/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:56:07,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:56:07,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:56:07,243 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:56:07,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:56:07,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:56:07,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:56:07,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:56:07,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:56:07,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:56:07,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:56:07,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:56:07,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:56:07,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:56:07,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:56:07,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:56:07,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:56:07,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:56:07,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:56:07,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:56:07,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:56:07,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:56:07,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:56:07,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:56:07,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:56:07,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:56:07,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:56:07,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:56:07,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:56:07,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:56:07,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:56:07,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:56:07,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:56:07,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:56:07,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:56:07,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:56:07,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:56:07,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:56:07,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:56:07,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:56:07,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:56:07,275 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:56:07,290 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:56:07,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:56:07,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:56:07,291 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:56:07,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:56:07,292 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:56:07,292 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:56:07,292 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:56:07,292 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:56:07,292 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:56:07,292 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:56:07,293 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:56:07,293 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:56:07,293 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:56:07,293 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:56:07,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:56:07,294 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:56:07,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:56:07,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:56:07,294 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:56:07,294 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:56:07,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:56:07,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:56:07,295 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:56:07,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:56:07,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:56:07,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:56:07,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:56:07,296 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:56:07,464 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:56:07,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:56:07,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:56:07,483 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:56:07,483 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:56:07,484 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:56:07,550 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_JqthTm/tmp/bb9675fcbbcf4f36ace6b079676b0aba/FLAGd14b9f275 [2020-07-01 12:56:07,890 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:56:07,891 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:56:07,891 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:56:07,897 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_JqthTm/tmp/bb9675fcbbcf4f36ace6b079676b0aba/FLAGd14b9f275 [2020-07-01 12:56:15,741 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_JqthTm/tmp/bb9675fcbbcf4f36ace6b079676b0aba [2020-07-01 12:56:15,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:56:15,754 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:56:15,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:56:15,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:56:15,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:56:15,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:56:15" (1/1) ... [2020-07-01 12:56:15,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45e62db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:15, skipping insertion in model container [2020-07-01 12:56:15,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:56:15" (1/1) ... [2020-07-01 12:56:15,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:56:15,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:56:16,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:56:16,038 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:56:16,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:56:16,073 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:56:16,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16 WrapperNode [2020-07-01 12:56:16,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:56:16,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:56:16,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:56:16,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:56:16,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (1/1) ... [2020-07-01 12:56:16,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (1/1) ... [2020-07-01 12:56:16,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:56:16,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:56:16,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:56:16,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:56:16,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (1/1) ... [2020-07-01 12:56:16,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (1/1) ... [2020-07-01 12:56:16,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (1/1) ... [2020-07-01 12:56:16,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (1/1) ... [2020-07-01 12:56:16,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (1/1) ... [2020-07-01 12:56:16,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (1/1) ... [2020-07-01 12:56:16,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (1/1) ... [2020-07-01 12:56:16,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:56:16,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:56:16,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:56:16,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:56:16,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:56:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:56:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:56:16,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:56:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:56:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:56:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:56:16,606 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:56:16,607 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:56:16,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:16 BoogieIcfgContainer [2020-07-01 12:56:16,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:56:16,612 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:56:16,612 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:56:16,614 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:56:16,615 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:16" (1/1) ... [2020-07-01 12:56:16,633 INFO L313 BlockEncoder]: Initial Icfg 79 locations, 84 edges [2020-07-01 12:56:16,635 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:56:16,635 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:56:16,636 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:56:16,636 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:56:16,638 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:56:16,639 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:56:16,639 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:56:16,670 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:56:16,723 INFO L200 BlockEncoder]: SBE split 41 edges [2020-07-01 12:56:16,729 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:56:16,731 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:56:16,784 INFO L100 BaseMinimizeStates]: Removed 24 edges and 12 locations by large block encoding [2020-07-01 12:56:16,787 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 12:56:16,789 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:56:16,789 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:56:16,790 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:56:16,790 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:56:16,791 INFO L313 BlockEncoder]: Encoded RCFG 65 locations, 122 edges [2020-07-01 12:56:16,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:56:16 BasicIcfg [2020-07-01 12:56:16,791 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:56:16,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:56:16,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:56:16,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:56:16,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:56:15" (1/4) ... [2020-07-01 12:56:16,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243c5205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:56:16, skipping insertion in model container [2020-07-01 12:56:16,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (2/4) ... [2020-07-01 12:56:16,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243c5205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:56:16, skipping insertion in model container [2020-07-01 12:56:16,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:16" (3/4) ... [2020-07-01 12:56:16,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243c5205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:56:16, skipping insertion in model container [2020-07-01 12:56:16,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:56:16" (4/4) ... [2020-07-01 12:56:16,800 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:56:16,811 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:56:16,818 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 38 error locations. [2020-07-01 12:56:16,832 INFO L251 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2020-07-01 12:56:16,855 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:56:16,856 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:56:16,856 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:56:16,856 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:56:16,856 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:56:16,856 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:56:16,856 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:56:16,857 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:56:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-01 12:56:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:56:16,878 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:16,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:56:16,879 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:16,885 INFO L82 PathProgramCache]: Analyzing trace with hash 184458, now seen corresponding path program 1 times [2020-07-01 12:56:16,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:16,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313848785] [2020-07-01 12:56:16,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:17,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313848785] [2020-07-01 12:56:17,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:17,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:17,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026384173] [2020-07-01 12:56:17,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:17,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:17,083 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-07-01 12:56:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:17,290 INFO L93 Difference]: Finished difference Result 128 states and 227 transitions. [2020-07-01 12:56:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:17,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:56:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:17,304 INFO L225 Difference]: With dead ends: 128 [2020-07-01 12:56:17,304 INFO L226 Difference]: Without dead ends: 65 [2020-07-01 12:56:17,308 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-01 12:56:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-01 12:56:17,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-01 12:56:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 107 transitions. [2020-07-01 12:56:17,349 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 107 transitions. Word has length 3 [2020-07-01 12:56:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:17,350 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 107 transitions. [2020-07-01 12:56:17,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 107 transitions. [2020-07-01 12:56:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:56:17,350 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:17,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:56:17,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:56:17,352 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:17,353 INFO L82 PathProgramCache]: Analyzing trace with hash 184923, now seen corresponding path program 1 times [2020-07-01 12:56:17,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:17,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013396969] [2020-07-01 12:56:17,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:17,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013396969] [2020-07-01 12:56:17,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:17,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:17,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129177601] [2020-07-01 12:56:17,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:17,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:17,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:17,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:17,400 INFO L87 Difference]: Start difference. First operand 65 states and 107 transitions. Second operand 3 states. [2020-07-01 12:56:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:17,525 INFO L93 Difference]: Finished difference Result 68 states and 107 transitions. [2020-07-01 12:56:17,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:17,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:56:17,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:17,527 INFO L225 Difference]: With dead ends: 68 [2020-07-01 12:56:17,528 INFO L226 Difference]: Without dead ends: 65 [2020-07-01 12:56:17,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-01 12:56:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-01 12:56:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-01 12:56:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 104 transitions. [2020-07-01 12:56:17,536 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 104 transitions. Word has length 3 [2020-07-01 12:56:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:17,537 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 104 transitions. [2020-07-01 12:56:17,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2020-07-01 12:56:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:56:17,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:17,538 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:56:17,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:56:17,538 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:17,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:17,539 INFO L82 PathProgramCache]: Analyzing trace with hash 184924, now seen corresponding path program 1 times [2020-07-01 12:56:17,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:17,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008917601] [2020-07-01 12:56:17,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:17,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008917601] [2020-07-01 12:56:17,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:17,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:17,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000580464] [2020-07-01 12:56:17,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:17,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:17,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:17,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:17,622 INFO L87 Difference]: Start difference. First operand 65 states and 104 transitions. Second operand 3 states. [2020-07-01 12:56:17,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:17,804 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2020-07-01 12:56:17,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:17,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:56:17,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:17,806 INFO L225 Difference]: With dead ends: 65 [2020-07-01 12:56:17,806 INFO L226 Difference]: Without dead ends: 62 [2020-07-01 12:56:17,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-01 12:56:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-07-01 12:56:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-01 12:56:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 101 transitions. [2020-07-01 12:56:17,812 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 101 transitions. Word has length 3 [2020-07-01 12:56:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:17,813 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 101 transitions. [2020-07-01 12:56:17,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 101 transitions. [2020-07-01 12:56:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:56:17,813 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:17,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:56:17,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:56:17,814 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:17,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:17,814 INFO L82 PathProgramCache]: Analyzing trace with hash 184921, now seen corresponding path program 1 times [2020-07-01 12:56:17,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:17,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225745716] [2020-07-01 12:56:17,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:17,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225745716] [2020-07-01 12:56:17,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:17,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:17,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163558698] [2020-07-01 12:56:17,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:17,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:17,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:17,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:17,858 INFO L87 Difference]: Start difference. First operand 62 states and 101 transitions. Second operand 3 states. [2020-07-01 12:56:17,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:17,995 INFO L93 Difference]: Finished difference Result 62 states and 101 transitions. [2020-07-01 12:56:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:17,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:56:17,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:17,996 INFO L225 Difference]: With dead ends: 62 [2020-07-01 12:56:17,996 INFO L226 Difference]: Without dead ends: 59 [2020-07-01 12:56:17,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-01 12:56:18,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-01 12:56:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-01 12:56:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 95 transitions. [2020-07-01 12:56:18,002 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 95 transitions. Word has length 3 [2020-07-01 12:56:18,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:18,002 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 95 transitions. [2020-07-01 12:56:18,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 95 transitions. [2020-07-01 12:56:18,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:56:18,003 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:18,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:56:18,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:56:18,004 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:18,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:18,004 INFO L82 PathProgramCache]: Analyzing trace with hash 5728779, now seen corresponding path program 1 times [2020-07-01 12:56:18,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:18,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792450131] [2020-07-01 12:56:18,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:18,041 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792450131] [2020-07-01 12:56:18,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:18,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:18,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138498964] [2020-07-01 12:56:18,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:18,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:18,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:18,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,043 INFO L87 Difference]: Start difference. First operand 59 states and 95 transitions. Second operand 3 states. [2020-07-01 12:56:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:18,169 INFO L93 Difference]: Finished difference Result 59 states and 95 transitions. [2020-07-01 12:56:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:18,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:56:18,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:18,171 INFO L225 Difference]: With dead ends: 59 [2020-07-01 12:56:18,171 INFO L226 Difference]: Without dead ends: 56 [2020-07-01 12:56:18,172 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-01 12:56:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-01 12:56:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-01 12:56:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 89 transitions. [2020-07-01 12:56:18,177 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 89 transitions. Word has length 4 [2020-07-01 12:56:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:18,177 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 89 transitions. [2020-07-01 12:56:18,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 89 transitions. [2020-07-01 12:56:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:56:18,178 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:18,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:56:18,178 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:56:18,178 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash 5728781, now seen corresponding path program 1 times [2020-07-01 12:56:18,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:18,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258673860] [2020-07-01 12:56:18,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:18,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258673860] [2020-07-01 12:56:18,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:18,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:18,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305038984] [2020-07-01 12:56:18,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:18,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:18,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:18,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,221 INFO L87 Difference]: Start difference. First operand 56 states and 89 transitions. Second operand 3 states. [2020-07-01 12:56:18,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:18,329 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2020-07-01 12:56:18,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:18,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:56:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:18,330 INFO L225 Difference]: With dead ends: 56 [2020-07-01 12:56:18,330 INFO L226 Difference]: Without dead ends: 53 [2020-07-01 12:56:18,331 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-01 12:56:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-01 12:56:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-01 12:56:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2020-07-01 12:56:18,335 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 83 transitions. Word has length 4 [2020-07-01 12:56:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:18,335 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 83 transitions. [2020-07-01 12:56:18,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 83 transitions. [2020-07-01 12:56:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:56:18,336 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:18,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:56:18,336 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:56:18,337 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:18,337 INFO L82 PathProgramCache]: Analyzing trace with hash 177590024, now seen corresponding path program 1 times [2020-07-01 12:56:18,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:18,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875508833] [2020-07-01 12:56:18,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:18,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875508833] [2020-07-01 12:56:18,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:18,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:18,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213404595] [2020-07-01 12:56:18,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:18,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:18,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:18,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,372 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. Second operand 3 states. [2020-07-01 12:56:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:18,457 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2020-07-01 12:56:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:18,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:56:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:18,458 INFO L225 Difference]: With dead ends: 53 [2020-07-01 12:56:18,458 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:56:18,459 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:56:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 12:56:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 12:56:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2020-07-01 12:56:18,462 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 5 [2020-07-01 12:56:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:18,463 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2020-07-01 12:56:18,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2020-07-01 12:56:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:56:18,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:18,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:56:18,464 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:56:18,464 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash 177590026, now seen corresponding path program 1 times [2020-07-01 12:56:18,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:18,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695991157] [2020-07-01 12:56:18,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:18,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695991157] [2020-07-01 12:56:18,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:18,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:18,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701355017] [2020-07-01 12:56:18,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:18,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:18,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:18,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,501 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand 3 states. [2020-07-01 12:56:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:18,602 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions. [2020-07-01 12:56:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:18,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:56:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:18,603 INFO L225 Difference]: With dead ends: 47 [2020-07-01 12:56:18,604 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:56:18,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:56:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-01 12:56:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-01 12:56:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2020-07-01 12:56:18,608 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 5 [2020-07-01 12:56:18,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:18,608 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2020-07-01 12:56:18,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2020-07-01 12:56:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:56:18,609 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:18,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:18,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:56:18,610 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:18,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:18,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1134777208, now seen corresponding path program 1 times [2020-07-01 12:56:18,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:18,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212668626] [2020-07-01 12:56:18,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:18,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212668626] [2020-07-01 12:56:18,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:18,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:18,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917304355] [2020-07-01 12:56:18,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:18,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:18,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:18,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,654 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 3 states. [2020-07-01 12:56:18,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:18,729 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2020-07-01 12:56:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:18,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:56:18,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:18,730 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:56:18,730 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:56:18,731 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:56:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:56:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:56:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-07-01 12:56:18,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 7 [2020-07-01 12:56:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:18,734 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-07-01 12:56:18,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-07-01 12:56:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:56:18,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:56:18,735 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:18,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:56:18,736 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:56:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:18,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1134777210, now seen corresponding path program 1 times [2020-07-01 12:56:18,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:18,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008030470] [2020-07-01 12:56:18,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:18,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008030470] [2020-07-01 12:56:18,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:18,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:56:18,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182154683] [2020-07-01 12:56:18,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:56:18,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:18,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:18,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,772 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 3 states. [2020-07-01 12:56:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:18,827 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-07-01 12:56:18,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:18,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:56:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:56:18,828 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:56:18,828 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:56:18,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:56:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:56:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:56:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:56:18,830 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-07-01 12:56:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:56:18,830 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:56:18,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:56:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:56:18,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:56:18,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:56:18,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:56:18,874 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-01 12:56:18,874 INFO L268 CegarLoopResult]: For program point L23-2(line 23) no Hoare annotation was computed. [2020-07-01 12:56:18,874 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 12:56:18,875 INFO L268 CegarLoopResult]: For program point L19-2(line 19) no Hoare annotation was computed. [2020-07-01 12:56:18,875 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:56:18,875 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:56:18,875 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:56:18,875 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:56:18,875 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:56:18,875 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:56:18,875 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:56:18,875 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:56:18,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:56:18,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:56:18,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:56:18,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:56:18,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:56:18,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:56:18,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:56:18,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:56:18,876 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:56:18,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:56:18,877 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:56:18,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:56:18,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:56:18,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:56:18,877 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:56:18,877 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-01 12:56:18,877 INFO L268 CegarLoopResult]: For program point L21-1(lines 21 24) no Hoare annotation was computed. [2020-07-01 12:56:18,878 INFO L268 CegarLoopResult]: For program point L21-3(lines 5 26) no Hoare annotation was computed. [2020-07-01 12:56:18,878 INFO L268 CegarLoopResult]: For program point L21-4(lines 21 24) no Hoare annotation was computed. [2020-07-01 12:56:18,878 INFO L268 CegarLoopResult]: For program point L17-1(lines 17 20) no Hoare annotation was computed. [2020-07-01 12:56:18,878 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 20) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_subxy_~z~0.base)) (= 1 (select |#valid| ULTIMATE.start_subxy_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_subxy_~x_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_subxy_~y_ref~0.base)) (<= 1 |#StackHeapBarrier|) (= 4 (select |#length| ULTIMATE.start_subxy_~z~0.base)) (= 0 ULTIMATE.start_subxy_~i~0.offset) (= 0 ULTIMATE.start_subxy_~x_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_subxy_~x_ref~0.base)) (= 0 ULTIMATE.start_subxy_~z~0.offset) (= (select |#length| ULTIMATE.start_subxy_~i~0.base) 4) (= 0 ULTIMATE.start_subxy_~y_ref~0.offset) (= 1 (select |#valid| ULTIMATE.start_subxy_~y_ref~0.base))) [2020-07-01 12:56:18,878 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:56:18,879 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:56:18,879 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:56:18,879 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:56:18,879 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 23) no Hoare annotation was computed. [2020-07-01 12:56:18,879 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:56:18,879 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 12:56:18,879 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:56:18,879 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 12:56:18,879 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:56:18,880 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:56:18,880 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-01 12:56:18,880 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:56:18,880 INFO L268 CegarLoopResult]: For program point L22-2(line 22) no Hoare annotation was computed. [2020-07-01 12:56:18,880 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:56:18,880 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:56:18,880 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:56:18,880 INFO L268 CegarLoopResult]: For program point L18-2(line 18) no Hoare annotation was computed. [2020-07-01 12:56:18,881 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:56:18,881 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 12:56:18,881 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:56:18,881 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:56:18,881 INFO L268 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-07-01 12:56:18,881 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:56:18,881 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:56:18,881 INFO L268 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2020-07-01 12:56:18,881 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 12:56:18,882 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:56:18,882 INFO L268 CegarLoopResult]: For program point L14-5(line 14) no Hoare annotation was computed. [2020-07-01 12:56:18,882 INFO L268 CegarLoopResult]: For program point L14-6(lines 14 16) no Hoare annotation was computed. [2020-07-01 12:56:18,882 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:56:18,882 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:56:18,885 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:56:18,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:18,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:18,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:56:18,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:18,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:18,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:18,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:18,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:56:18,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:18,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:18,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:56:18 BasicIcfg [2020-07-01 12:56:18,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:56:18,907 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:56:18,907 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:56:18,910 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:56:18,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:18,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:56:15" (1/5) ... [2020-07-01 12:56:18,912 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45ef7e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:56:18, skipping insertion in model container [2020-07-01 12:56:18,912 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:18,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:56:16" (2/5) ... [2020-07-01 12:56:18,913 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45ef7e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:56:18, skipping insertion in model container [2020-07-01 12:56:18,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:18,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:56:16" (3/5) ... [2020-07-01 12:56:18,913 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45ef7e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:56:18, skipping insertion in model container [2020-07-01 12:56:18,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:18,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:56:16" (4/5) ... [2020-07-01 12:56:18,914 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45ef7e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:56:18, skipping insertion in model container [2020-07-01 12:56:18,914 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:56:18,914 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:56:18" (5/5) ... [2020-07-01 12:56:18,915 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:56:18,937 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:56:18,937 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:56:18,937 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:56:18,937 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:56:18,937 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:56:18,938 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:56:18,938 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:56:18,938 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:56:18,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states. [2020-07-01 12:56:18,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-07-01 12:56:18,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:56:18,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:56:18,954 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:18,955 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:56:18,955 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:56:18,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states. [2020-07-01 12:56:18,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-07-01 12:56:18,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:56:18,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:56:18,959 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:56:18,959 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:56:18,964 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue [153] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 10#L-1true [253] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (= (store .cse0 |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 1) |v_#valid_3|) (= (select |v_#valid_7| |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_subxy_~x_1 |v_ULTIMATE.start_subxy_#in~x_1|) (= v_ULTIMATE.start_subxy_~y_1 |v_ULTIMATE.start_subxy_#in~y_1|) (= 0 (select .cse1 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|)) (= v_ULTIMATE.start_subxy_~x_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc0.offset_1|) (= v_ULTIMATE.start_subxy_~x_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (= 0 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (= v_ULTIMATE.start_subxy_~i~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (= |v_ULTIMATE.start_subxy_#in~y_1| v_ULTIMATE.start_main_~y~0_1) (= (store (store (store (store |v_#length_5| |v_ULTIMATE.start_subxy_#t~malloc0.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc2.base_1| 4) |v_ULTIMATE.start_subxy_#t~malloc3.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_subxy_~y_ref~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) (= |v_ULTIMATE.start_subxy_#in~x_1| v_ULTIMATE.start_main_~x~0_1) (= 0 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (= v_ULTIMATE.start_subxy_~z~0.base_1 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|) (= 0 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_subxy_#t~malloc3.base_1|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_subxy_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~y~0_1 |v_ULTIMATE.start_main_#t~nondet21_22|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_subxy_#t~malloc1.base_1|) (= 0 (select .cse2 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|)) (= v_ULTIMATE.start_subxy_~y_ref~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc1.offset_1|) (= v_ULTIMATE.start_subxy_~i~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc3.offset_1|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc2.base_1|) (= v_ULTIMATE.start_main_~x~0_1 |v_ULTIMATE.start_main_#t~nondet20_22|) (> |v_ULTIMATE.start_subxy_#t~malloc1.base_1| 0) (= |v_ULTIMATE.start_subxy_#t~malloc0.offset_1| 0) (= v_ULTIMATE.start_subxy_~z~0.offset_1 |v_ULTIMATE.start_subxy_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_subxy_#t~malloc0.base_1|) (< 0 |v_ULTIMATE.start_subxy_#t~malloc0.base_1|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_1, ULTIMATE.start_subxy_#t~malloc2.offset=|v_ULTIMATE.start_subxy_#t~malloc2.offset_1|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_1, ULTIMATE.start_subxy_#res=|v_ULTIMATE.start_subxy_#res_1|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_1|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_1|, ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_1|, ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_1, ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_1|, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_1, ULTIMATE.start_subxy_#t~mem19=|v_ULTIMATE.start_subxy_#t~mem19_1|, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_1|, ULTIMATE.start_subxy_#t~mem14=|v_ULTIMATE.start_subxy_#t~mem14_1|, ULTIMATE.start_subxy_#t~mem15=|v_ULTIMATE.start_subxy_#t~mem15_1|, ULTIMATE.start_main_#t~ret22=|v_ULTIMATE.start_main_#t~ret22_1|, ULTIMATE.start_subxy_#t~mem17=|v_ULTIMATE.start_subxy_#t~mem17_1|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_1|, #length=|v_#length_1|, ULTIMATE.start_subxy_#t~mem13=|v_ULTIMATE.start_subxy_#t~mem13_1|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_1, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_1, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_1|, ULTIMATE.start_main_#t~nondet20=|v_ULTIMATE.start_main_#t~nondet20_1|, ULTIMATE.start_subxy_#in~x=|v_ULTIMATE.start_subxy_#in~x_1|, ULTIMATE.start_subxy_#t~malloc2.base=|v_ULTIMATE.start_subxy_#t~malloc2.base_1|, ULTIMATE.start_subxy_#t~malloc0.offset=|v_ULTIMATE.start_subxy_#t~malloc0.offset_1|, ULTIMATE.start_subxy_#t~post18=|v_ULTIMATE.start_subxy_#t~post18_1|, ULTIMATE.start_subxy_#t~post16=|v_ULTIMATE.start_subxy_#t~post16_1|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_1, ULTIMATE.start_subxy_#t~malloc0.base=|v_ULTIMATE.start_subxy_#t~malloc0.base_1|, ULTIMATE.start_subxy_#t~malloc1.base=|v_ULTIMATE.start_subxy_#t~malloc1.base_1|, ULTIMATE.start_subxy_#t~malloc3.offset=|v_ULTIMATE.start_subxy_#t~malloc3.offset_1|, ULTIMATE.start_subxy_#t~malloc3.base=|v_ULTIMATE.start_subxy_#t~malloc3.base_1|, ULTIMATE.start_subxy_#in~y=|v_ULTIMATE.start_subxy_#in~y_1|, ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_1, ULTIMATE.start_subxy_#t~malloc1.offset=|v_ULTIMATE.start_subxy_#t~malloc1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_1|, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_1|, #valid=|v_#valid_3|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_1|, ULTIMATE.start_main_~y~0=v_ULTIMATE.start_main_~y~0_1, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_1, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_1} AuxVars[|v_ULTIMATE.start_main_#t~nondet21_22|, |v_ULTIMATE.start_main_#t~nondet20_22|] AssignedVars[ULTIMATE.start_subxy_~x_ref~0.offset, ULTIMATE.start_subxy_#t~malloc2.offset, ULTIMATE.start_subxy_~y_ref~0.base, ULTIMATE.start_subxy_#res, ULTIMATE.start_subxy_#t~mem8, ULTIMATE.start_subxy_#t~mem9, ULTIMATE.start_subxy_#t~short7, ULTIMATE.start_subxy_~y_ref~0.offset, ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_~z~0.offset, ULTIMATE.start_subxy_#t~mem19, ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem14, ULTIMATE.start_subxy_#t~mem15, ULTIMATE.start_main_#t~ret22, ULTIMATE.start_subxy_#t~mem17, ULTIMATE.start_subxy_#t~mem11, #length, ULTIMATE.start_subxy_#t~mem13, ULTIMATE.start_subxy_~x_ref~0.base, ULTIMATE.start_subxy_~z~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet20, ULTIMATE.start_subxy_#in~x, ULTIMATE.start_subxy_#t~malloc2.base, ULTIMATE.start_subxy_#t~malloc0.offset, ULTIMATE.start_subxy_#t~post18, ULTIMATE.start_subxy_#t~post16, ULTIMATE.start_main_~x~0, ULTIMATE.start_subxy_#t~malloc0.base, ULTIMATE.start_subxy_#t~malloc1.base, ULTIMATE.start_subxy_#t~malloc3.offset, ULTIMATE.start_subxy_#t~malloc3.base, ULTIMATE.start_subxy_#in~y, ULTIMATE.start_subxy_~i~0.base, ULTIMATE.start_subxy_#t~malloc1.offset, ULTIMATE.start_subxy_#t~mem4, ULTIMATE.start_subxy_~x, ULTIMATE.start_main_#res, ULTIMATE.start_subxy_#t~mem6, #valid, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_main_~y~0, ULTIMATE.start_subxy_~y, ULTIMATE.start_subxy_~i~0.offset] 12#L10true [124] L10-->L10-1: Formula: (and (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_3 4) (select |v_#length_6| v_ULTIMATE.start_subxy_~x_ref~0.base_3)) (= (select |v_#valid_8| v_ULTIMATE.start_subxy_~x_ref~0.base_3) 1) (= (store |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_subxy_~x_ref~0.base_3) v_ULTIMATE.start_subxy_~x_ref~0.offset_3 v_ULTIMATE.start_subxy_~x_3)) |v_#memory_int_1|) (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_3)) InVars {ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_3, ULTIMATE.start_subxy_~x=v_ULTIMATE.start_subxy_~x_3, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_1|, #length=|v_#length_6|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 60#L10-1true [181] L10-1-->L11: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_subxy_~y_ref~0.base_3) v_ULTIMATE.start_subxy_~y_ref~0.offset_3 v_ULTIMATE.start_subxy_~y_3))) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_3 4) (select |v_#length_8| v_ULTIMATE.start_subxy_~y_ref~0.base_3)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_subxy_~y_ref~0.base_3))) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_3, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_3, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_subxy_~y=v_ULTIMATE.start_subxy_~y_3, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 31#L11true [154] L11-->L12: Formula: (and (= 1 (select |v_#valid_12| v_ULTIMATE.start_subxy_~z~0.base_3)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_3) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_3 4) (select |v_#length_10| v_ULTIMATE.start_subxy_~z~0.base_3)) (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_subxy_~z~0.base_3) v_ULTIMATE.start_subxy_~z~0.offset_3 0)))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_3, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_3, #length=|v_#length_10|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[#memory_int] 46#L12true [164] L12-->L13: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~x_ref~0.offset_5) (= 1 (select |v_#valid_14| v_ULTIMATE.start_subxy_~x_ref~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subxy_~x_ref~0.base_6) v_ULTIMATE.start_subxy_~x_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem4_2|) (<= (+ v_ULTIMATE.start_subxy_~x_ref~0.offset_5 4) (select |v_#length_12| v_ULTIMATE.start_subxy_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_subxy_~x_ref~0.offset=v_ULTIMATE.start_subxy_~x_ref~0.offset_5, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_subxy_~x_ref~0.base=v_ULTIMATE.start_subxy_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4] 65#L13true [334] L13-->L14: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24 (store (select |v_#memory_int_29| v_ULTIMATE.start_subxy_~i~0.base_24) v_ULTIMATE.start_subxy_~i~0.offset_17 |v_ULTIMATE.start_subxy_#t~mem4_6|)) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_17) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_17 4) (select |v_#length_44| v_ULTIMATE.start_subxy_~i~0.base_24)) (= 1 (select |v_#valid_56| v_ULTIMATE.start_subxy_~i~0.base_24))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_6|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_29|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_24, ULTIMATE.start_subxy_#t~mem4=|v_ULTIMATE.start_subxy_#t~mem4_5|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_28|, #length=|v_#length_44|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem4, #memory_int] 21#L14true [139] L14-->L14-1: Formula: (and (= 1 (select |v_#valid_18| v_ULTIMATE.start_subxy_~y_ref~0.base_6)) (<= (+ v_ULTIMATE.start_subxy_~y_ref~0.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_subxy_~y_ref~0.base_6)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_subxy_~y_ref~0.base_6) v_ULTIMATE.start_subxy_~y_ref~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem5_2|) (<= 0 v_ULTIMATE.start_subxy_~y_ref~0.offset_5)) InVars {ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_subxy_~y_ref~0.offset=v_ULTIMATE.start_subxy_~y_ref~0.offset_5, ULTIMATE.start_subxy_~y_ref~0.base=v_ULTIMATE.start_subxy_~y_ref~0.base_6, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem5] 20#L14-1true [279] L14-1-->L14-2: Formula: (and (not |v_ULTIMATE.start_subxy_#t~short7_2|) (> |v_ULTIMATE.start_subxy_#t~mem5_3| 0)) InVars {ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_2|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~short7] 17#L14-2true [134] L14-2-->L14-6: Formula: |v_ULTIMATE.start_subxy_#t~short7_3| InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_3|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_3|} AuxVars[] AssignedVars[] 59#L14-6true [180] L14-6-->L17-3: Formula: (not |v_ULTIMATE.start_subxy_#t~short7_9|) InVars {ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_9|} OutVars{ULTIMATE.start_subxy_#t~short7=|v_ULTIMATE.start_subxy_#t~short7_8|, ULTIMATE.start_subxy_#t~mem6=|v_ULTIMATE.start_subxy_#t~mem6_5|, ULTIMATE.start_subxy_#t~mem5=|v_ULTIMATE.start_subxy_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem6, ULTIMATE.start_subxy_#t~mem5, ULTIMATE.start_subxy_#t~short7] 67#L17-3true [2020-07-01 12:56:18,966 INFO L796 eck$LassoCheckResult]: Loop: 67#L17-3true [192] L17-3-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_5) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_subxy_~i~0.base_6) v_ULTIMATE.start_subxy_~i~0.offset_5) |v_ULTIMATE.start_subxy_#t~mem8_2|) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_5 4) (select |v_#length_20| v_ULTIMATE.start_subxy_~i~0.base_6)) (= 1 (select |v_#valid_27| v_ULTIMATE.start_subxy_~i~0.base_6))) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_6, #valid=|v_#valid_27|, ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_2|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 52#L17-1true [171] L17-1-->L18: Formula: (< 0 |v_ULTIMATE.start_subxy_#t~mem8_6|) InVars {ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_6|} OutVars{ULTIMATE.start_subxy_#t~mem8=|v_ULTIMATE.start_subxy_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~mem8] 7#L18true [337] L18-->L18-2: Formula: (and (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_18 4) (select |v_#length_45| v_ULTIMATE.start_subxy_~i~0.base_25)) (= |v_ULTIMATE.start_subxy_#t~post10_5| |v_ULTIMATE.start_subxy_#t~mem9_5|) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_18) (= 1 (select |v_#valid_57| v_ULTIMATE.start_subxy_~i~0.base_25)) (= (select (select |v_#memory_int_30| v_ULTIMATE.start_subxy_~i~0.base_25) v_ULTIMATE.start_subxy_~i~0.offset_18) |v_ULTIMATE.start_subxy_#t~mem9_5|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_25, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_5|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_30|, #length=|v_#length_45|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_5|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_18} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, ULTIMATE.start_subxy_#t~mem9] 5#L18-2true [338] L18-2-->L19: Formula: (and (= 1 (select |v_#valid_58| v_ULTIMATE.start_subxy_~i~0.base_26)) (<= 0 v_ULTIMATE.start_subxy_~i~0.offset_19) (<= (+ v_ULTIMATE.start_subxy_~i~0.offset_19 4) (select |v_#length_46| v_ULTIMATE.start_subxy_~i~0.base_26)) (= (store |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26 (store (select |v_#memory_int_32| v_ULTIMATE.start_subxy_~i~0.base_26) v_ULTIMATE.start_subxy_~i~0.offset_19 (+ |v_ULTIMATE.start_subxy_#t~post10_7| (- 1)))) |v_#memory_int_31|)) InVars {ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_7|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_32|, #length=|v_#length_46|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} OutVars{ULTIMATE.start_subxy_~i~0.base=v_ULTIMATE.start_subxy_~i~0.base_26, ULTIMATE.start_subxy_#t~post10=|v_ULTIMATE.start_subxy_#t~post10_6|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_31|, #length=|v_#length_46|, ULTIMATE.start_subxy_#t~mem9=|v_ULTIMATE.start_subxy_#t~mem9_6|, ULTIMATE.start_subxy_~i~0.offset=v_ULTIMATE.start_subxy_~i~0.offset_19} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post10, #memory_int, ULTIMATE.start_subxy_#t~mem9] 28#L19true [341] L19-->L19-2: Formula: (and (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_16) (= 1 (select |v_#valid_62| v_ULTIMATE.start_subxy_~z~0.base_22)) (= |v_ULTIMATE.start_subxy_#t~post12_5| |v_ULTIMATE.start_subxy_#t~mem11_5|) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_16 4) (select |v_#length_49| v_ULTIMATE.start_subxy_~z~0.base_22)) (= (select (select |v_#memory_int_35| v_ULTIMATE.start_subxy_~z~0.base_22) v_ULTIMATE.start_subxy_~z~0.offset_16) |v_ULTIMATE.start_subxy_#t~mem11_5|)) InVars {ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, #length=|v_#length_49|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_5|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_22, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_16, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_35|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_5|, #length=|v_#length_49|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, ULTIMATE.start_subxy_#t~mem11] 25#L19-2true [343] L19-2-->L17-3: Formula: (and (= 1 (select |v_#valid_64| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= (+ v_ULTIMATE.start_subxy_~z~0.offset_17 4) (select |v_#length_51| v_ULTIMATE.start_subxy_~z~0.base_23)) (<= 0 v_ULTIMATE.start_subxy_~z~0.offset_17) (= (store |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23 (store (select |v_#memory_int_39| v_ULTIMATE.start_subxy_~z~0.base_23) v_ULTIMATE.start_subxy_~z~0.offset_17 (+ |v_ULTIMATE.start_subxy_#t~post12_7| 1))) |v_#memory_int_38|)) InVars {ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_7|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_39|, #length=|v_#length_51|} OutVars{ULTIMATE.start_subxy_#t~post12=|v_ULTIMATE.start_subxy_#t~post12_6|, ULTIMATE.start_subxy_~z~0.base=v_ULTIMATE.start_subxy_~z~0.base_23, ULTIMATE.start_subxy_~z~0.offset=v_ULTIMATE.start_subxy_~z~0.offset_17, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_38|, ULTIMATE.start_subxy_#t~mem11=|v_ULTIMATE.start_subxy_#t~mem11_6|, #length=|v_#length_51|} AuxVars[] AssignedVars[ULTIMATE.start_subxy_#t~post12, #memory_int, ULTIMATE.start_subxy_#t~mem11] 67#L17-3true [2020-07-01 12:56:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:18,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1320144480, now seen corresponding path program 1 times [2020-07-01 12:56:18,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:18,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696112948] [2020-07-01 12:56:18,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:56:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:56:18,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696112948] [2020-07-01 12:56:18,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:56:18,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:56:18,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735572674] [2020-07-01 12:56:18,999 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:56:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:56:19,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2037336529, now seen corresponding path program 1 times [2020-07-01 12:56:19,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:56:19,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514310187] [2020-07-01 12:56:19,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:56:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:56:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:56:19,033 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:56:19,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:56:19,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:56:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:56:19,111 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-07-01 12:56:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:56:19,295 INFO L93 Difference]: Finished difference Result 67 states and 124 transitions. [2020-07-01 12:56:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:56:19,297 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:56:19,302 INFO L168 Benchmark]: Toolchain (without parser) took 3547.29 ms. Allocated memory was 514.9 MB in the beginning and 574.1 MB in the end (delta: 59.2 MB). Free memory was 438.1 MB in the beginning and 457.1 MB in the end (delta: -19.1 MB). Peak memory consumption was 40.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:19,302 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:56:19,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.00 ms. Allocated memory was 514.9 MB in the beginning and 533.7 MB in the end (delta: 18.9 MB). Free memory was 437.5 MB in the beginning and 500.6 MB in the end (delta: -63.0 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:19,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.75 ms. Allocated memory is still 533.7 MB. Free memory was 500.6 MB in the beginning and 498.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:19,304 INFO L168 Benchmark]: Boogie Preprocessor took 26.85 ms. Allocated memory is still 533.7 MB. Free memory was 498.3 MB in the beginning and 496.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:19,304 INFO L168 Benchmark]: RCFGBuilder took 466.24 ms. Allocated memory is still 533.7 MB. Free memory was 496.7 MB in the beginning and 465.5 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:19,305 INFO L168 Benchmark]: BlockEncodingV2 took 179.17 ms. Allocated memory is still 533.7 MB. Free memory was 465.5 MB in the beginning and 448.7 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:19,305 INFO L168 Benchmark]: TraceAbstraction took 2114.26 ms. Allocated memory was 533.7 MB in the beginning and 574.1 MB in the end (delta: 40.4 MB). Free memory was 447.6 MB in the beginning and 515.1 MB in the end (delta: -67.5 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:56:19,306 INFO L168 Benchmark]: BuchiAutomizer took 392.25 ms. Allocated memory is still 574.1 MB. Free memory was 515.1 MB in the beginning and 457.1 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:56:19,309 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 79 locations, 84 edges - StatisticsResult: Encoded RCFG 65 locations, 122 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 319.00 ms. Allocated memory was 514.9 MB in the beginning and 533.7 MB in the end (delta: 18.9 MB). Free memory was 437.5 MB in the beginning and 500.6 MB in the end (delta: -63.0 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 43.75 ms. Allocated memory is still 533.7 MB. Free memory was 500.6 MB in the beginning and 498.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 26.85 ms. Allocated memory is still 533.7 MB. Free memory was 498.3 MB in the beginning and 496.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 466.24 ms. Allocated memory is still 533.7 MB. Free memory was 496.7 MB in the beginning and 465.5 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 179.17 ms. Allocated memory is still 533.7 MB. Free memory was 465.5 MB in the beginning and 448.7 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2114.26 ms. Allocated memory was 533.7 MB in the beginning and 574.1 MB in the end (delta: 40.4 MB). Free memory was 447.6 MB in the beginning and 515.1 MB in the end (delta: -67.5 MB). There was no memory consumed. Max. memory is 50.3 GB. * BuchiAutomizer took 392.25 ms. Allocated memory is still 574.1 MB. Free memory was 515.1 MB in the beginning and 457.1 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 38 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant [2020-07-01 12:56:19,320 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:19,320 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:19,320 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:56:19,321 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:19,321 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:19,322 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:19,322 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:19,322 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:56:19,322 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:56:19,323 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((1 == \valid[z] && 1 == \valid[i]) && 4 == unknown-#length-unknown[x_ref]) && 4 == unknown-#length-unknown[y_ref]) && 1 <= unknown-#StackHeapBarrier-unknown) && 4 == unknown-#length-unknown[z]) && 0 == i) && 0 == x_ref) && 1 == \valid[x_ref]) && 0 == z) && unknown-#length-unknown[i] == 4) && 0 == y_ref) && 1 == \valid[y_ref] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 65 locations, 38 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.9s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 93 SDtfs, 750 SDslu, 5 SDs, 0 SdLazy, 694 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 56 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:56:05.067 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_JqthTm/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:56:19.550 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check