/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 10:58:51,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 10:58:51,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 10:58:51,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 10:58:51,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 10:58:51,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 10:58:51,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 10:58:51,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 10:58:51,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 10:58:51,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 10:58:51,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 10:58:51,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 10:58:51,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 10:58:51,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 10:58:51,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 10:58:51,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 10:58:51,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 10:58:51,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 10:58:51,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 10:58:51,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 10:58:51,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 10:58:51,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 10:58:51,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 10:58:51,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 10:58:51,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 10:58:51,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 10:58:51,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 10:58:51,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 10:58:51,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 10:58:51,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 10:58:51,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 10:58:51,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 10:58:51,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 10:58:51,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 10:58:51,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 10:58:51,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 10:58:51,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 10:58:51,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 10:58:51,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 10:58:51,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 10:58:51,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 10:58:51,294 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 10:58:51,309 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 10:58:51,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 10:58:51,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 10:58:51,310 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 10:58:51,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 10:58:51,311 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 10:58:51,311 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 10:58:51,311 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 10:58:51,311 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 10:58:51,312 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 10:58:51,312 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 10:58:51,312 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 10:58:51,312 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 10:58:51,312 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 10:58:51,312 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:58:51,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 10:58:51,313 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 10:58:51,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 10:58:51,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 10:58:51,313 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 10:58:51,314 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 10:58:51,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 10:58:51,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 10:58:51,314 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 10:58:51,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 10:58:51,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 10:58:51,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 10:58:51,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 10:58:51,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 10:58:51,485 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 10:58:51,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 10:58:51,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 10:58:51,504 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 10:58:51,504 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 10:58:51,505 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 10:58:51,563 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_8rv4xC/tmp/319e07e22dd24e9db6760188cb1ead81/FLAG96955881e [2020-07-01 10:58:51,942 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 10:58:51,943 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 10:58:51,956 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_8rv4xC/tmp/319e07e22dd24e9db6760188cb1ead81/FLAG96955881e [2020-07-01 10:58:52,300 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_8rv4xC/tmp/319e07e22dd24e9db6760188cb1ead81 [2020-07-01 10:58:52,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 10:58:52,313 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 10:58:52,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 10:58:52,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 10:58:52,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 10:58:52,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 10:58:52" (1/1) ... [2020-07-01 10:58:52,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fef8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52, skipping insertion in model container [2020-07-01 10:58:52,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 10:58:52" (1/1) ... [2020-07-01 10:58:52,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 10:58:52,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 10:58:52,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 10:58:52,717 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 10:58:52,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 10:58:52,823 INFO L208 MainTranslator]: Completed translation [2020-07-01 10:58:52,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52 WrapperNode [2020-07-01 10:58:52,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 10:58:52,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 10:58:52,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 10:58:52,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 10:58:52,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (1/1) ... [2020-07-01 10:58:52,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (1/1) ... [2020-07-01 10:58:52,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 10:58:52,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 10:58:52,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 10:58:52,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 10:58:52,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (1/1) ... [2020-07-01 10:58:52,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (1/1) ... [2020-07-01 10:58:52,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (1/1) ... [2020-07-01 10:58:52,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (1/1) ... [2020-07-01 10:58:52,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (1/1) ... [2020-07-01 10:58:52,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (1/1) ... [2020-07-01 10:58:52,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (1/1) ... [2020-07-01 10:58:52,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 10:58:52,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 10:58:52,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 10:58:52,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 10:58:52,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (1/1) ... No working directory specified, using /export/starexec/sandbox/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 10:58:53,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 10:58:53,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 10:58:53,897 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 10:58:53,897 INFO L295 CfgBuilder]: Removed 39 assume(true) statements. [2020-07-01 10:58:53,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:58:53 BoogieIcfgContainer [2020-07-01 10:58:53,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 10:58:53,905 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 10:58:53,905 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 10:58:53,907 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 10:58:53,908 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:58:53" (1/1) ... [2020-07-01 10:58:53,935 INFO L313 BlockEncoder]: Initial Icfg 265 locations, 487 edges [2020-07-01 10:58:53,937 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 10:58:53,938 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 10:58:53,939 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 10:58:53,939 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 10:58:53,941 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 10:58:53,942 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 10:58:53,942 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 10:58:54,001 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 10:58:54,066 INFO L200 BlockEncoder]: SBE split 195 edges [2020-07-01 10:58:54,074 INFO L70 emoveInfeasibleEdges]: Removed 31 edges and 0 locations because of local infeasibility [2020-07-01 10:58:54,077 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:58:54,170 INFO L100 BaseMinimizeStates]: Removed 54 edges and 27 locations by large block encoding [2020-07-01 10:58:54,173 INFO L70 RemoveSinkStates]: Removed 11 edges and 7 locations by removing sink states [2020-07-01 10:58:54,176 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 10:58:54,177 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:58:54,184 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-07-01 10:58:54,185 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 10:58:54,187 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 10:58:54,188 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 10:58:54,189 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 10:58:54,189 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 10:58:54,191 INFO L313 BlockEncoder]: Encoded RCFG 228 locations, 610 edges [2020-07-01 10:58:54,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:58:54 BasicIcfg [2020-07-01 10:58:54,192 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 10:58:54,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 10:58:54,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 10:58:54,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 10:58:54,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 10:58:52" (1/4) ... [2020-07-01 10:58:54,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659eea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 10:58:54, skipping insertion in model container [2020-07-01 10:58:54,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (2/4) ... [2020-07-01 10:58:54,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659eea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 10:58:54, skipping insertion in model container [2020-07-01 10:58:54,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:58:53" (3/4) ... [2020-07-01 10:58:54,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659eea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:58:54, skipping insertion in model container [2020-07-01 10:58:54,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:58:54" (4/4) ... [2020-07-01 10:58:54,201 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 10:58:54,212 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 10:58:54,222 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-07-01 10:58:54,236 INFO L251 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-07-01 10:58:54,263 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 10:58:54,263 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 10:58:54,263 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 10:58:54,263 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 10:58:54,263 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 10:58:54,263 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 10:58:54,264 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 10:58:54,264 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 10:58:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states. [2020-07-01 10:58:54,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 10:58:54,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 228 states. [2020-07-01 10:58:54,513 INFO L271 CegarLoopResult]: At program point L894(lines 868 895) the Hoare annotation is: true [2020-07-01 10:58:54,513 INFO L268 CegarLoopResult]: For program point L267(lines 267 271) no Hoare annotation was computed. [2020-07-01 10:58:54,513 INFO L268 CegarLoopResult]: For program point L779(lines 779 783) no Hoare annotation was computed. [2020-07-01 10:58:54,514 INFO L268 CegarLoopResult]: For program point L746(lines 746 799) no Hoare annotation was computed. [2020-07-01 10:58:54,514 INFO L271 CegarLoopResult]: At program point L168-2(lines 168 196) the Hoare annotation is: true [2020-07-01 10:58:54,514 INFO L271 CegarLoopResult]: At program point L135-2(lines 135 163) the Hoare annotation is: true [2020-07-01 10:58:54,515 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 10:58:54,515 INFO L268 CegarLoopResult]: For program point L1308(lines 1308 1312) no Hoare annotation was computed. [2020-07-01 10:58:54,515 INFO L268 CegarLoopResult]: For program point L763(lines 763 767) no Hoare annotation was computed. [2020-07-01 10:58:54,515 INFO L268 CegarLoopResult]: For program point L697(lines 697 701) no Hoare annotation was computed. [2020-07-01 10:58:54,515 INFO L268 CegarLoopResult]: For program point L664(lines 664 717) no Hoare annotation was computed. [2020-07-01 10:58:54,515 INFO L268 CegarLoopResult]: For program point L1110(lines 1109 1150) no Hoare annotation was computed. [2020-07-01 10:58:54,516 INFO L271 CegarLoopResult]: At program point L1292(lines 1285 1302) the Hoare annotation is: true [2020-07-01 10:58:54,516 INFO L271 CegarLoopResult]: At program point L235(lines 228 254) the Hoare annotation is: true [2020-07-01 10:58:54,516 INFO L268 CegarLoopResult]: For program point L747(lines 747 751) no Hoare annotation was computed. [2020-07-01 10:58:54,516 INFO L268 CegarLoopResult]: For program point L169(lines 168 196) no Hoare annotation was computed. [2020-07-01 10:58:54,516 INFO L268 CegarLoopResult]: For program point L681(lines 681 685) no Hoare annotation was computed. [2020-07-01 10:58:54,516 INFO L268 CegarLoopResult]: For program point L136(lines 135 163) no Hoare annotation was computed. [2020-07-01 10:58:54,517 INFO L271 CegarLoopResult]: At program point L615(lines 608 625) the Hoare annotation is: true [2020-07-01 10:58:54,517 INFO L271 CegarLoopResult]: At program point L962(lines 955 972) the Hoare annotation is: true [2020-07-01 10:58:54,517 INFO L271 CegarLoopResult]: At program point L1276(lines 1269 1304) the Hoare annotation is: true [2020-07-01 10:58:54,517 INFO L271 CegarLoopResult]: At program point L219(lines 212 256) the Hoare annotation is: true [2020-07-01 10:58:54,517 INFO L268 CegarLoopResult]: For program point L665(lines 665 669) no Hoare annotation was computed. [2020-07-01 10:58:54,517 INFO L268 CegarLoopResult]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2020-07-01 10:58:54,518 INFO L268 CegarLoopResult]: For program point L1293(lines 1245 1334) no Hoare annotation was computed. [2020-07-01 10:58:54,518 INFO L271 CegarLoopResult]: At program point L1260(lines 1253 1306) the Hoare annotation is: true [2020-07-01 10:58:54,518 INFO L268 CegarLoopResult]: For program point L1227(lines 1227 1231) no Hoare annotation was computed. [2020-07-01 10:58:54,518 INFO L271 CegarLoopResult]: At program point L104(lines 104 116) the Hoare annotation is: true [2020-07-01 10:58:54,518 INFO L268 CegarLoopResult]: For program point L616(lines 608 625) no Hoare annotation was computed. [2020-07-01 10:58:54,518 INFO L271 CegarLoopResult]: At program point L1062(lines 1055 1072) the Hoare annotation is: true [2020-07-01 10:58:54,518 INFO L268 CegarLoopResult]: For program point L963(lines 955 972) no Hoare annotation was computed. [2020-07-01 10:58:54,519 INFO L268 CegarLoopResult]: For program point L451(lines 451 455) no Hoare annotation was computed. [2020-07-01 10:58:54,519 INFO L271 CegarLoopResult]: At program point L1211(lines 1204 1221) the Hoare annotation is: true [2020-07-01 10:58:54,519 INFO L271 CegarLoopResult]: At program point L121(lines 91 833) the Hoare annotation is: true [2020-07-01 10:58:54,519 INFO L271 CegarLoopResult]: At program point L1046(lines 1039 1074) the Hoare annotation is: true [2020-07-01 10:58:54,519 INFO L271 CegarLoopResult]: At program point L435(lines 428 445) the Hoare annotation is: true [2020-07-01 10:58:54,519 INFO L268 CegarLoopResult]: For program point L369(lines 369 373) no Hoare annotation was computed. [2020-07-01 10:58:54,520 INFO L268 CegarLoopResult]: For program point L1294(lines 1294 1298) no Hoare annotation was computed. [2020-07-01 10:58:54,520 INFO L268 CegarLoopResult]: For program point L237(lines 237 241) no Hoare annotation was computed. [2020-07-01 10:58:54,520 INFO L268 CegarLoopResult]: For program point L204(lines 204 257) no Hoare annotation was computed. [2020-07-01 10:58:54,520 INFO L271 CegarLoopResult]: At program point L1195(lines 1188 1223) the Hoare annotation is: true [2020-07-01 10:58:54,521 INFO L268 CegarLoopResult]: For program point L1162(lines 1162 1166) no Hoare annotation was computed. [2020-07-01 10:58:54,521 INFO L268 CegarLoopResult]: For program point L617(lines 617 621) no Hoare annotation was computed. [2020-07-01 10:58:54,521 INFO L268 CegarLoopResult]: For program point L1162-2(lines 1160 1339) no Hoare annotation was computed. [2020-07-01 10:58:54,521 INFO L268 CegarLoopResult]: For program point L1063(lines 866 1096) no Hoare annotation was computed. [2020-07-01 10:58:54,521 INFO L271 CegarLoopResult]: At program point L1030(lines 1023 1076) the Hoare annotation is: true [2020-07-01 10:58:54,521 INFO L271 CegarLoopResult]: At program point L518-2(lines 518 546) the Hoare annotation is: true [2020-07-01 10:58:54,521 INFO L268 CegarLoopResult]: For program point L964(lines 964 968) no Hoare annotation was computed. [2020-07-01 10:58:54,522 INFO L271 CegarLoopResult]: At program point L485-2(lines 485 513) the Hoare annotation is: true [2020-07-01 10:58:54,522 INFO L271 CegarLoopResult]: At program point L419(lines 412 447) the Hoare annotation is: true [2020-07-01 10:58:54,522 INFO L271 CegarLoopResult]: At program point L353(lines 346 363) the Hoare annotation is: true [2020-07-01 10:58:54,522 INFO L268 CegarLoopResult]: For program point L1278(lines 1278 1282) no Hoare annotation was computed. [2020-07-01 10:58:54,522 INFO L268 CegarLoopResult]: For program point L221(lines 221 225) no Hoare annotation was computed. [2020-07-01 10:58:54,522 INFO L268 CegarLoopResult]: For program point L1212(lines 1160 1339) no Hoare annotation was computed. [2020-07-01 10:58:54,522 INFO L271 CegarLoopResult]: At program point L1179(lines 1172 1225) the Hoare annotation is: true [2020-07-01 10:58:54,523 INFO L271 CegarLoopResult]: At program point L981(lines 981 988) the Hoare annotation is: true [2020-07-01 10:58:54,523 INFO L268 CegarLoopResult]: For program point L436(lines 124 470) no Hoare annotation was computed. [2020-07-01 10:58:54,523 INFO L271 CegarLoopResult]: At program point L403(lines 396 449) the Hoare annotation is: true [2020-07-01 10:58:54,523 INFO L271 CegarLoopResult]: At program point L337(lines 330 365) the Hoare annotation is: true [2020-07-01 10:58:54,523 INFO L268 CegarLoopResult]: For program point L1328(lines 1328 1332) no Hoare annotation was computed. [2020-07-01 10:58:54,523 INFO L268 CegarLoopResult]: For program point L1328-1(lines 1160 1339) no Hoare annotation was computed. [2020-07-01 10:58:54,523 INFO L268 CegarLoopResult]: For program point L1262(lines 1262 1266) no Hoare annotation was computed. [2020-07-01 10:58:54,524 INFO L268 CegarLoopResult]: For program point L205(lines 205 209) no Hoare annotation was computed. [2020-07-01 10:58:54,524 INFO L271 CegarLoopResult]: At program point L585(lines 578 604) the Hoare annotation is: true [2020-07-01 10:58:54,524 INFO L268 CegarLoopResult]: For program point L1064(lines 1064 1068) no Hoare annotation was computed. [2020-07-01 10:58:54,524 INFO L268 CegarLoopResult]: For program point L519(lines 518 546) no Hoare annotation was computed. [2020-07-01 10:58:54,524 INFO L268 CegarLoopResult]: For program point L486(lines 485 513) no Hoare annotation was computed. [2020-07-01 10:58:54,524 INFO L271 CegarLoopResult]: At program point L932(lines 925 951) the Hoare annotation is: true [2020-07-01 10:58:54,524 INFO L268 CegarLoopResult]: For program point L387(lines 387 393) no Hoare annotation was computed. [2020-07-01 10:58:54,525 INFO L268 CegarLoopResult]: For program point L354(lines 124 470) no Hoare annotation was computed. [2020-07-01 10:58:54,525 INFO L271 CegarLoopResult]: At program point L387-1(lines 387 393) the Hoare annotation is: true [2020-07-01 10:58:54,525 INFO L271 CegarLoopResult]: At program point L866-1(lines 850 1101) the Hoare annotation is: true [2020-07-01 10:58:54,526 INFO L271 CegarLoopResult]: At program point L321(lines 314 367) the Hoare annotation is: true [2020-07-01 10:58:54,526 INFO L268 CegarLoopResult]: For program point L1213(lines 1213 1217) no Hoare annotation was computed. [2020-07-01 10:58:54,526 INFO L268 CegarLoopResult]: For program point L1114(lines 1114 1118) no Hoare annotation was computed. [2020-07-01 10:58:54,526 INFO L268 CegarLoopResult]: For program point L1114-1(lines 1109 1150) no Hoare annotation was computed. [2020-07-01 10:58:54,526 INFO L271 CegarLoopResult]: At program point L569(lines 562 606) the Hoare annotation is: true [2020-07-01 10:58:54,526 INFO L268 CegarLoopResult]: For program point L1048(lines 1048 1052) no Hoare annotation was computed. [2020-07-01 10:58:54,526 INFO L268 CegarLoopResult]: For program point L437(lines 437 441) no Hoare annotation was computed. [2020-07-01 10:58:54,527 INFO L271 CegarLoopResult]: At program point L916(lines 909 953) the Hoare annotation is: true [2020-07-01 10:58:54,527 INFO L268 CegarLoopResult]: For program point L1197(lines 1197 1201) no Hoare annotation was computed. [2020-07-01 10:58:54,527 INFO L271 CegarLoopResult]: At program point L107(lines 107 115) the Hoare annotation is: true [2020-07-01 10:58:54,527 INFO L268 CegarLoopResult]: For program point L1032(lines 1032 1036) no Hoare annotation was computed. [2020-07-01 10:58:54,527 INFO L268 CegarLoopResult]: For program point L421(lines 421 425) no Hoare annotation was computed. [2020-07-01 10:58:54,527 INFO L268 CegarLoopResult]: For program point L355(lines 355 359) no Hoare annotation was computed. [2020-07-01 10:58:54,528 INFO L268 CegarLoopResult]: For program point L801(lines 801 805) no Hoare annotation was computed. [2020-07-01 10:58:54,528 INFO L268 CegarLoopResult]: For program point L1181(lines 1181 1185) no Hoare annotation was computed. [2020-07-01 10:58:54,528 INFO L271 CegarLoopResult]: At program point L124-2(lines 124 470) the Hoare annotation is: true [2020-07-01 10:58:54,528 INFO L271 CegarLoopResult]: At program point L1016(lines 990 1017) the Hoare annotation is: true [2020-07-01 10:58:54,528 INFO L268 CegarLoopResult]: For program point L405(lines 405 409) no Hoare annotation was computed. [2020-07-01 10:58:54,528 INFO L268 CegarLoopResult]: For program point L851(lines 851 863) no Hoare annotation was computed. [2020-07-01 10:58:54,528 INFO L268 CegarLoopResult]: For program point L339(lines 339 343) no Hoare annotation was computed. [2020-07-01 10:58:54,528 INFO L271 CegarLoopResult]: At program point L785(lines 778 795) the Hoare annotation is: true [2020-07-01 10:58:54,529 INFO L268 CegarLoopResult]: For program point L719(lines 719 723) no Hoare annotation was computed. [2020-07-01 10:58:54,529 INFO L268 CegarLoopResult]: For program point L587(lines 587 591) no Hoare annotation was computed. [2020-07-01 10:58:54,529 INFO L268 CegarLoopResult]: For program point L554(lines 554 607) no Hoare annotation was computed. [2020-07-01 10:58:54,529 INFO L268 CegarLoopResult]: For program point L934(lines 934 938) no Hoare annotation was computed. [2020-07-01 10:58:54,529 INFO L268 CegarLoopResult]: For program point L901(lines 901 954) no Hoare annotation was computed. [2020-07-01 10:58:54,529 INFO L268 CegarLoopResult]: For program point L323(lines 323 327) no Hoare annotation was computed. [2020-07-01 10:58:54,529 INFO L271 CegarLoopResult]: At program point L1314(lines 1307 1324) the Hoare annotation is: true [2020-07-01 10:58:54,530 INFO L271 CegarLoopResult]: At program point L769(lines 762 797) the Hoare annotation is: true [2020-07-01 10:58:54,530 INFO L271 CegarLoopResult]: At program point L703(lines 696 713) the Hoare annotation is: true [2020-07-01 10:58:54,530 INFO L271 CegarLoopResult]: At program point L125(lines 124 470) the Hoare annotation is: true [2020-07-01 10:58:54,530 INFO L268 CegarLoopResult]: For program point L92(lines 92 120) no Hoare annotation was computed. [2020-07-01 10:58:54,531 INFO L268 CegarLoopResult]: For program point L571(lines 571 575) no Hoare annotation was computed. [2020-07-01 10:58:54,531 INFO L268 CegarLoopResult]: For program point L918(lines 918 922) no Hoare annotation was computed. [2020-07-01 10:58:54,531 INFO L271 CegarLoopResult]: At program point L307(lines 277 308) the Hoare annotation is: true [2020-07-01 10:58:54,531 INFO L268 CegarLoopResult]: For program point L786(lines 475 827) no Hoare annotation was computed. [2020-07-01 10:58:54,531 INFO L271 CegarLoopResult]: At program point L753(lines 746 799) the Hoare annotation is: true [2020-07-01 10:58:54,531 INFO L271 CegarLoopResult]: At program point L687(lines 680 715) the Hoare annotation is: true [2020-07-01 10:58:54,531 INFO L268 CegarLoopResult]: For program point L555(lines 555 559) no Hoare annotation was computed. [2020-07-01 10:58:54,532 INFO L268 CegarLoopResult]: For program point L902(lines 902 906) no Hoare annotation was computed. [2020-07-01 10:58:54,532 INFO L268 CegarLoopResult]: For program point L869-1(lines 866 1096) no Hoare annotation was computed. [2020-07-01 10:58:54,532 INFO L268 CegarLoopResult]: For program point L1315(lines 1245 1334) no Hoare annotation was computed. [2020-07-01 10:58:54,532 INFO L268 CegarLoopResult]: For program point L737(lines 737 743) no Hoare annotation was computed. [2020-07-01 10:58:54,532 INFO L268 CegarLoopResult]: For program point L704(lines 475 827) no Hoare annotation was computed. [2020-07-01 10:58:54,532 INFO L271 CegarLoopResult]: At program point L737-1(lines 737 743) the Hoare annotation is: true [2020-07-01 10:58:54,532 INFO L271 CegarLoopResult]: At program point L671(lines 664 717) the Hoare annotation is: true [2020-07-01 10:58:54,533 INFO L271 CegarLoopResult]: At program point L1084(lines 1077 1094) the Hoare annotation is: true [2020-07-01 10:58:54,533 INFO L268 CegarLoopResult]: For program point L787(lines 787 791) no Hoare annotation was computed. [2020-07-01 10:58:54,533 INFO L271 CegarLoopResult]: At program point L1233(lines 1226 1243) the Hoare annotation is: true [2020-07-01 10:58:54,533 INFO L268 CegarLoopResult]: For program point L1167-1(lines 1160 1339) no Hoare annotation was computed. [2020-07-01 10:58:54,533 INFO L271 CegarLoopResult]: At program point L110(lines 110 114) the Hoare annotation is: true [2020-07-01 10:58:54,533 INFO L271 CegarLoopResult]: At program point L457(lines 450 467) the Hoare annotation is: true [2020-07-01 10:58:54,533 INFO L268 CegarLoopResult]: For program point L870(lines 869 893) no Hoare annotation was computed. [2020-07-01 10:58:54,534 INFO L268 CegarLoopResult]: For program point L1316(lines 1316 1320) no Hoare annotation was computed. [2020-07-01 10:58:54,534 INFO L268 CegarLoopResult]: For program point L259(lines 259 263) no Hoare annotation was computed. [2020-07-01 10:58:54,534 INFO L268 CegarLoopResult]: For program point L771(lines 771 775) no Hoare annotation was computed. [2020-07-01 10:58:54,534 INFO L268 CegarLoopResult]: For program point L705(lines 705 709) no Hoare annotation was computed. [2020-07-01 10:58:54,534 INFO L271 CegarLoopResult]: At program point L1151(lines 1103 1156) the Hoare annotation is: true [2020-07-01 10:58:54,534 INFO L268 CegarLoopResult]: For program point L1085(lines 1077 1094) no Hoare annotation was computed. [2020-07-01 10:58:54,534 INFO L271 CegarLoopResult]: At program point L375(lines 368 385) the Hoare annotation is: true [2020-07-01 10:58:54,534 INFO L271 CegarLoopResult]: At program point L854(lines 854 862) the Hoare annotation is: true [2020-07-01 10:58:54,535 INFO L271 CegarLoopResult]: At program point L243(lines 236 253) the Hoare annotation is: true [2020-07-01 10:58:54,535 INFO L268 CegarLoopResult]: For program point L755(lines 755 759) no Hoare annotation was computed. [2020-07-01 10:58:54,535 INFO L268 CegarLoopResult]: For program point L689(lines 689 693) no Hoare annotation was computed. [2020-07-01 10:58:54,535 INFO L271 CegarLoopResult]: At program point L1135(lines 1109 1150) the Hoare annotation is: true [2020-07-01 10:58:54,536 INFO L268 CegarLoopResult]: For program point L458(lines 450 467) no Hoare annotation was computed. [2020-07-01 10:58:54,536 INFO L271 CegarLoopResult]: At program point L1284(lines 1277 1303) the Hoare annotation is: true [2020-07-01 10:58:54,536 INFO L271 CegarLoopResult]: At program point L227(lines 220 255) the Hoare annotation is: true [2020-07-01 10:58:54,536 INFO L268 CegarLoopResult]: For program point L673(lines 673 677) no Hoare annotation was computed. [2020-07-01 10:58:54,536 INFO L271 CegarLoopResult]: At program point L95(lines 95 119) the Hoare annotation is: true [2020-07-01 10:58:54,536 INFO L268 CegarLoopResult]: For program point L1086(lines 1086 1090) no Hoare annotation was computed. [2020-07-01 10:58:54,536 INFO L271 CegarLoopResult]: At program point L475-2(lines 475 827) the Hoare annotation is: true [2020-07-01 10:58:54,537 INFO L268 CegarLoopResult]: For program point L376(lines 368 385) no Hoare annotation was computed. [2020-07-01 10:58:54,537 INFO L271 CegarLoopResult]: At program point L1268(lines 1261 1305) the Hoare annotation is: true [2020-07-01 10:58:54,537 INFO L268 CegarLoopResult]: For program point L244(lines 124 470) no Hoare annotation was computed. [2020-07-01 10:58:54,537 INFO L268 CegarLoopResult]: For program point L1235(lines 1235 1239) no Hoare annotation was computed. [2020-07-01 10:58:54,537 INFO L271 CegarLoopResult]: At program point L211(lines 204 257) the Hoare annotation is: true [2020-07-01 10:58:54,537 INFO L271 CegarLoopResult]: At program point L657(lines 627 658) the Hoare annotation is: true [2020-07-01 10:58:54,537 INFO L268 CegarLoopResult]: For program point L459(lines 459 463) no Hoare annotation was computed. [2020-07-01 10:58:54,538 INFO L271 CegarLoopResult]: At program point L1120(lines 1109 1150) the Hoare annotation is: true [2020-07-01 10:58:54,538 INFO L271 CegarLoopResult]: At program point L1054(lines 1047 1073) the Hoare annotation is: true [2020-07-01 10:58:54,538 INFO L268 CegarLoopResult]: For program point L476(lines 475 827) no Hoare annotation was computed. [2020-07-01 10:58:54,538 INFO L268 CegarLoopResult]: For program point L377(lines 377 381) no Hoare annotation was computed. [2020-07-01 10:58:54,538 INFO L268 CegarLoopResult]: For program point L245(lines 245 249) no Hoare annotation was computed. [2020-07-01 10:58:54,538 INFO L271 CegarLoopResult]: At program point L278-2(lines 278 306) the Hoare annotation is: true [2020-07-01 10:58:54,538 INFO L271 CegarLoopResult]: At program point L1203(lines 1196 1222) the Hoare annotation is: true [2020-07-01 10:58:54,539 INFO L271 CegarLoopResult]: At program point L1038(lines 1031 1075) the Hoare annotation is: true [2020-07-01 10:58:54,539 INFO L271 CegarLoopResult]: At program point L427(lines 420 446) the Hoare annotation is: true [2020-07-01 10:58:54,539 INFO L271 CegarLoopResult]: At program point L807(lines 800 817) the Hoare annotation is: true [2020-07-01 10:58:54,539 INFO L268 CegarLoopResult]: For program point L1286(lines 1286 1290) no Hoare annotation was computed. [2020-07-01 10:58:54,539 INFO L268 CegarLoopResult]: For program point L1253(lines 1253 1306) no Hoare annotation was computed. [2020-07-01 10:58:54,539 INFO L268 CegarLoopResult]: For program point L229(lines 229 233) no Hoare annotation was computed. [2020-07-01 10:58:54,539 INFO L271 CegarLoopResult]: At program point L1187(lines 1180 1224) the Hoare annotation is: true [2020-07-01 10:58:54,540 INFO L268 CegarLoopResult]: For program point L609(lines 609 613) no Hoare annotation was computed. [2020-07-01 10:58:54,540 INFO L268 CegarLoopResult]: For program point L956(lines 956 960) no Hoare annotation was computed. [2020-07-01 10:58:54,540 INFO L271 CegarLoopResult]: At program point L411(lines 404 448) the Hoare annotation is: true [2020-07-01 10:58:54,541 INFO L271 CegarLoopResult]: At program point L857(lines 857 861) the Hoare annotation is: true [2020-07-01 10:58:54,541 INFO L271 CegarLoopResult]: At program point L345(lines 338 364) the Hoare annotation is: true [2020-07-01 10:58:54,541 INFO L268 CegarLoopResult]: For program point L279(lines 278 306) no Hoare annotation was computed. [2020-07-01 10:58:54,541 INFO L268 CegarLoopResult]: For program point L1270(lines 1270 1274) no Hoare annotation was computed. [2020-07-01 10:58:54,541 INFO L268 CegarLoopResult]: For program point L213(lines 213 217) no Hoare annotation was computed. [2020-07-01 10:58:54,541 INFO L271 CegarLoopResult]: At program point L725(lines 718 735) the Hoare annotation is: true [2020-07-01 10:58:54,541 INFO L271 CegarLoopResult]: At program point L593(lines 586 603) the Hoare annotation is: true [2020-07-01 10:58:54,542 INFO L271 CegarLoopResult]: At program point L940(lines 933 950) the Hoare annotation is: true [2020-07-01 10:58:54,542 INFO L271 CegarLoopResult]: At program point L329(lines 322 366) the Hoare annotation is: true [2020-07-01 10:58:54,542 INFO L271 CegarLoopResult]: At program point L808(lines 800 817) the Hoare annotation is: true [2020-07-01 10:58:54,542 INFO L268 CegarLoopResult]: For program point L1254(lines 1254 1258) no Hoare annotation was computed. [2020-07-01 10:58:54,542 INFO L271 CegarLoopResult]: At program point L197(lines 167 198) the Hoare annotation is: true [2020-07-01 10:58:54,542 INFO L271 CegarLoopResult]: At program point L164(lines 134 165) the Hoare annotation is: true [2020-07-01 10:58:54,542 INFO L271 CegarLoopResult]: At program point L98(lines 98 118) the Hoare annotation is: true [2020-07-01 10:58:54,543 INFO L271 CegarLoopResult]: At program point L577(lines 570 605) the Hoare annotation is: true [2020-07-01 10:58:54,543 INFO L268 CegarLoopResult]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2020-07-01 10:58:54,543 INFO L268 CegarLoopResult]: For program point L1023(lines 1023 1076) no Hoare annotation was computed. [2020-07-01 10:58:54,543 INFO L271 CegarLoopResult]: At program point L924(lines 917 952) the Hoare annotation is: true [2020-07-01 10:58:54,543 INFO L268 CegarLoopResult]: For program point L726(lines 718 735) no Hoare annotation was computed. [2020-07-01 10:58:54,543 INFO L268 CegarLoopResult]: For program point L1205(lines 1205 1209) no Hoare annotation was computed. [2020-07-01 10:58:54,543 INFO L268 CegarLoopResult]: For program point L1139(lines 1139 1146) no Hoare annotation was computed. [2020-07-01 10:58:54,543 INFO L268 CegarLoopResult]: For program point L594(lines 475 827) no Hoare annotation was computed. [2020-07-01 10:58:54,544 INFO L271 CegarLoopResult]: At program point L561(lines 554 607) the Hoare annotation is: true [2020-07-01 10:58:54,544 INFO L268 CegarLoopResult]: For program point L1040(lines 1040 1044) no Hoare annotation was computed. [2020-07-01 10:58:54,544 INFO L268 CegarLoopResult]: For program point L941(lines 866 1096) no Hoare annotation was computed. [2020-07-01 10:58:54,544 INFO L268 CegarLoopResult]: For program point L429(lines 429 433) no Hoare annotation was computed. [2020-07-01 10:58:54,544 INFO L271 CegarLoopResult]: At program point L908(lines 901 954) the Hoare annotation is: true [2020-07-01 10:58:54,544 INFO L268 CegarLoopResult]: For program point L396(lines 396 449) no Hoare annotation was computed. [2020-07-01 10:58:54,544 INFO L268 CegarLoopResult]: For program point L809(lines 809 813) no Hoare annotation was computed. [2020-07-01 10:58:54,545 INFO L268 CegarLoopResult]: For program point L1189(lines 1189 1193) no Hoare annotation was computed. [2020-07-01 10:58:54,545 INFO L268 CegarLoopResult]: For program point L1024(lines 1024 1028) no Hoare annotation was computed. [2020-07-01 10:58:54,545 INFO L268 CegarLoopResult]: For program point L991-1(lines 866 1096) no Hoare annotation was computed. [2020-07-01 10:58:54,545 INFO L268 CegarLoopResult]: For program point L413(lines 413 417) no Hoare annotation was computed. [2020-07-01 10:58:54,546 INFO L268 CegarLoopResult]: For program point L347(lines 347 351) no Hoare annotation was computed. [2020-07-01 10:58:54,546 INFO L268 CegarLoopResult]: For program point L314(lines 314 367) no Hoare annotation was computed. [2020-07-01 10:58:54,546 INFO L268 CegarLoopResult]: For program point L727(lines 727 731) no Hoare annotation was computed. [2020-07-01 10:58:54,546 INFO L268 CegarLoopResult]: For program point L1173(lines 1173 1177) no Hoare annotation was computed. [2020-07-01 10:58:54,546 INFO L268 CegarLoopResult]: For program point L595(lines 595 599) no Hoare annotation was computed. [2020-07-01 10:58:54,546 INFO L271 CegarLoopResult]: At program point L628-2(lines 628 656) the Hoare annotation is: true [2020-07-01 10:58:54,546 INFO L271 CegarLoopResult]: At program point L975(lines 975 989) the Hoare annotation is: true [2020-07-01 10:58:54,547 INFO L268 CegarLoopResult]: For program point L942(lines 942 946) no Hoare annotation was computed. [2020-07-01 10:58:54,547 INFO L268 CegarLoopResult]: For program point L397(lines 397 401) no Hoare annotation was computed. [2020-07-01 10:58:54,547 INFO L268 CegarLoopResult]: For program point L331(lines 331 335) no Hoare annotation was computed. [2020-07-01 10:58:54,547 INFO L271 CegarLoopResult]: At program point L265(lines 258 275) the Hoare annotation is: true [2020-07-01 10:58:54,547 INFO L271 CegarLoopResult]: At program point L777(lines 770 796) the Hoare annotation is: true [2020-07-01 10:58:54,547 INFO L268 CegarLoopResult]: For program point L1124(lines 1124 1131) no Hoare annotation was computed. [2020-07-01 10:58:54,547 INFO L268 CegarLoopResult]: For program point L579(lines 579 583) no Hoare annotation was computed. [2020-07-01 10:58:54,547 INFO L268 CegarLoopResult]: For program point L992(lines 991 1015) no Hoare annotation was computed. [2020-07-01 10:58:54,548 INFO L268 CegarLoopResult]: For program point L926(lines 926 930) no Hoare annotation was computed. [2020-07-01 10:58:54,548 INFO L268 CegarLoopResult]: For program point L315(lines 315 319) no Hoare annotation was computed. [2020-07-01 10:58:54,548 INFO L271 CegarLoopResult]: At program point L761(lines 754 798) the Hoare annotation is: true [2020-07-01 10:58:54,548 INFO L271 CegarLoopResult]: At program point L695(lines 688 714) the Hoare annotation is: true [2020-07-01 10:58:54,548 INFO L268 CegarLoopResult]: For program point L629(lines 628 656) no Hoare annotation was computed. [2020-07-01 10:58:54,548 INFO L268 CegarLoopResult]: For program point L563(lines 563 567) no Hoare annotation was computed. [2020-07-01 10:58:54,548 INFO L268 CegarLoopResult]: For program point L910(lines 910 914) no Hoare annotation was computed. [2020-07-01 10:58:54,548 INFO L268 CegarLoopResult]: For program point L266(lines 258 275) no Hoare annotation was computed. [2020-07-01 10:58:54,549 INFO L271 CegarLoopResult]: At program point L679(lines 672 716) the Hoare annotation is: true [2020-07-01 10:58:54,549 INFO L271 CegarLoopResult]: At program point L101(lines 101 117) the Hoare annotation is: true [2020-07-01 10:58:54,549 INFO L271 CegarLoopResult]: At program point L547(lines 517 548) the Hoare annotation is: true [2020-07-01 10:58:54,549 INFO L271 CegarLoopResult]: At program point L514(lines 484 515) the Hoare annotation is: true [2020-07-01 10:58:54,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:58:54 BasicIcfg [2020-07-01 10:58:54,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 10:58:54,563 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 10:58:54,563 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 10:58:54,566 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 10:58:54,567 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:58:54,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 10:58:52" (1/5) ... [2020-07-01 10:58:54,568 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1377e651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 10:58:54, skipping insertion in model container [2020-07-01 10:58:54,568 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:58:54,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 10:58:52" (2/5) ... [2020-07-01 10:58:54,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1377e651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 10:58:54, skipping insertion in model container [2020-07-01 10:58:54,569 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:58:54,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 10:58:53" (3/5) ... [2020-07-01 10:58:54,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1377e651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:58:54, skipping insertion in model container [2020-07-01 10:58:54,569 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:58:54,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 10:58:54" (4/5) ... [2020-07-01 10:58:54,570 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1377e651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:58:54, skipping insertion in model container [2020-07-01 10:58:54,570 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 10:58:54,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 10:58:54" (5/5) ... [2020-07-01 10:58:54,571 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 10:58:54,597 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 10:58:54,597 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 10:58:54,597 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 10:58:54,597 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 10:58:54,597 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 10:58:54,598 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 10:58:54,598 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 10:58:54,598 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 10:58:54,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states. [2020-07-01 10:58:54,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 209 [2020-07-01 10:58:54,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:58:54,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:58:54,643 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:58:54,643 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:58:54,643 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 10:58:54,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 228 states. [2020-07-01 10:58:54,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 209 [2020-07-01 10:58:54,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:58:54,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:58:54,654 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:58:54,654 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:58:54,659 INFO L794 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRYtrue [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 2 v_~c_write_req_ev~0_27) (= 0 v_~c_rsp_type~0_5) (= 0 v_~s_memory0~0_4) (= 0 v_~c_req_type~0_5) (= v_~rsp_tt_d~0_8 0) (= 0 v_~rsp_t_status~0_8) (= 0 v_~m_run_st~0_77) (= 0 v_~req_t_a~0_8) (= 1 v_~c_empty_rsp~0_12) (= 0 v_~c_rsp_d~0_5) (= 0 v_~rsp_tt_status~0_8) (= 0 v_~req_t_d~0_8) (= 1 v_~c_empty_req~0_12) (= 0 v_~s_run_st~0_33) (= 0 v_~d_t~0_14) (= 0 v_~rsp_t_status___0~0_6) (= 0 v_~req_t_a___0~0_6) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_t_type___0~0_6) (= 0 v_~rsp_t_d___0~0_6) (= 0 v_~a_t~0_14) (= 1 v_~m_run_i~0_5) (= 0 v_~m_run_pc~0_143) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_type~0_8) (= v_~s_run_pc~0_51 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_tt_type~0_8) (= 0 v_~rsp_t_d~0_8) (= 0 v_~c_req_d~0_5) (= 1 v_~s_run_i~0_5) (= 0 v_~req_t_d___0~0_6) (= 0 v_~req_t_type___0~0_6) (= 0 v_~req_t_type~0_8) (= v_~c_read_rsp_ev~0_27 2) (= 2 v_~c_read_req_ev~0_45) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~req_tt_d~0_8) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_tt_type~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~c_req_a~0_5)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 74#L1162true [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 184#L1162-2true [2103] L1162-2-->L1167-1: Formula: (and (= v_~s_run_st~0_4 2) (> 1 v_~s_run_i~0_4)) InVars {~s_run_i~0=v_~s_run_i~0_4} OutVars{~s_run_st~0=v_~s_run_st~0_4, ~s_run_i~0=v_~s_run_i~0_4} AuxVars[] AssignedVars[~s_run_st~0] 86#L1167-1true [1588] L1167-1-->L1173: Formula: (= 1 v_~m_run_pc~0_4) InVars {~m_run_pc~0=v_~m_run_pc~0_4} OutVars{~m_run_pc~0=v_~m_run_pc~0_4} AuxVars[] AssignedVars[] 72#L1173true [1560] L1173-->L1212: Formula: (and (= 1 v_~c_m_ev~0_6) (= v_~m_run_st~0_5 0)) InVars {~c_m_ev~0=v_~c_m_ev~0_6} OutVars{~c_m_ev~0=v_~c_m_ev~0_6, ~m_run_st~0=v_~m_run_st~0_5} AuxVars[] AssignedVars[~m_run_st~0] 167#L1212true [2111] L1212-->L1233: Formula: (< 2 v_~s_run_pc~0_7) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 92#L1233true [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 155#L1328-1true [2020-07-01 10:58:54,660 INFO L796 eck$LassoCheckResult]: Loop: 155#L1328-1true [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 170#L1135true [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 54#L1110true [2136] L1110-->L1114: Formula: (< 0 v_~m_run_st~0_17) InVars {~m_run_st~0=v_~m_run_st~0_17} OutVars{~m_run_st~0=v_~m_run_st~0_17} AuxVars[] AssignedVars[] 230#L1114true [2142] L1114-->L1151: Formula: (< 0 v_~s_run_st~0_10) InVars {~s_run_st~0=v_~s_run_st~0_10} OutVars{~s_run_st~0=v_~s_run_st~0_10} AuxVars[] AssignedVars[] 73#L1151true [1562] L1151-->L1253: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_5 3) InVars {} OutVars{ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_5} AuxVars[] AssignedVars[ULTIMATE.start_start_simulation_~kernel_st~0] 64#L1253true [1542] L1253-->L1254: Formula: (= 1 v_~m_run_pc~0_60) InVars {~m_run_pc~0=v_~m_run_pc~0_60} OutVars{~m_run_pc~0=v_~m_run_pc~0_60} AuxVars[] AssignedVars[] 18#L1254true [1449] L1254-->L1293: Formula: (and (= v_~m_run_st~0_31 0) (= 1 v_~c_m_ev~0_18)) InVars {~c_m_ev~0=v_~c_m_ev~0_18} OutVars{~c_m_ev~0=v_~c_m_ev~0_18, ~m_run_st~0=v_~m_run_st~0_31} AuxVars[] AssignedVars[~m_run_st~0] 113#L1293true [2152] L1293-->L1314: Formula: (> v_~s_run_pc~0_22 2) InVars {~s_run_pc~0=v_~s_run_pc~0_22} OutVars{~s_run_pc~0=v_~s_run_pc~0_22} AuxVars[] AssignedVars[] 35#L1314true [2164] L1314-->L1315: Formula: (> v_~s_run_pc~0_24 1) InVars {~s_run_pc~0=v_~s_run_pc~0_24} OutVars{~s_run_pc~0=v_~s_run_pc~0_24} AuxVars[] AssignedVars[] 112#L1315true [1642] L1315-->L1328-1: Formula: (= 0 v_~m_run_st~0_42) InVars {~m_run_st~0=v_~m_run_st~0_42} OutVars{~m_run_st~0=v_~m_run_st~0_42} AuxVars[] AssignedVars[] 155#L1328-1true [2020-07-01 10:58:54,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:58:54,667 INFO L82 PathProgramCache]: Analyzing trace with hash -787419167, now seen corresponding path program 1 times [2020-07-01 10:58:54,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:58:54,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097287166] [2020-07-01 10:58:54,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:58:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:58:54,796 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 10:58:54,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097287166] [2020-07-01 10:58:54,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:58:54,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:58:54,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282178972] [2020-07-01 10:58:54,803 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 10:58:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:58:54,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1184906646, now seen corresponding path program 1 times [2020-07-01 10:58:54,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:58:54,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058577109] [2020-07-01 10:58:54,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:58:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:58:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:58:54,839 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:58:54,911 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:58:54,911 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:58:54,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:58:54,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:58:54,912 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 10:58:54,912 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:58:54,913 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:58:54,913 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:58:54,913 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 10:58:54,913 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:58:54,913 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:58:54,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:54,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:54,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:54,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:54,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:54,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:54,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:54,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:54,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:54,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:55,086 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:58:55,087 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:58:55,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:58:55,104 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:58:55,114 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:58:55,115 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:58:55,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:58:55,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:58:55,165 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:58:55,165 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~s_run_st~0=1} Honda state: {~s_run_st~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:58:55,200 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:58:55,200 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:58:55,204 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:58:55,205 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~s_run_pc~0=3} Honda state: {~s_run_pc~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:58:55,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:58:55,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:58:55,244 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:58:55,244 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:58:55,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:58:55,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:58:55,285 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:58:55,285 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~m_run_pc~0=1} Honda state: {~m_run_pc~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:58:55,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:58:55,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:58:55,323 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-01 10:58:55,323 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:58:55,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:58:55,362 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:58:55,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 10:58:55,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:58:55,451 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 10:58:55,455 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:58:55,455 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:58:55,455 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:58:55,455 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:58:55,455 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 10:58:55,455 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:58:55,455 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:58:55,456 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:58:55,456 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-07-01 10:58:55,456 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:58:55,456 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:58:55,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:55,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:55,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:55,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:55,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:55,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:55,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:55,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:55,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:55,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:55,589 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:58:55,595 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:58:55,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:58:55,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:58:55,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:58:55,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:58:55,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:58:55,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:58:55,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:58:55,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:58:55,608 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:58:55,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:58:55,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:58:55,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:58:55,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:58:55,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:58:55,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:58:55,644 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:58:55,644 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:58:55,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:58:55,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:58:55,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:58:55,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:58:55,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:58:55,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:58:55,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:58:55,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:58:55,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:58:55,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:58:55,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:58:55,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:58:55,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:58:55,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:58:55,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:58:55,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:58:55,723 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:58:55,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:58:55,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:58:55,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:58:55,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:58:55,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:58:55,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:58:55,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:58:55,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:58:55,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:58:55,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:58:55,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:58:55,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:58:55,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:58:55,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:58:55,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:58:55,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:58:55,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:58:55,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:58:55,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:58:55,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:58:55,831 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:58:55,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:58:55,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:58:55,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:58:55,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:58:55,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:58:55,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:58:55,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:58:55,838 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 10:58:55,843 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 10:58:55,843 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:58:55,849 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 10:58:55,850 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 10:58:55,850 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 10:58:55,851 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~m_run_st~0) = 1*~m_run_st~0 Supporting invariants [] [2020-07-01 10:58:55,884 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 10:58:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:58:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:58:55,943 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:58:55,944 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:58:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:58:55,961 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:58:55,961 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:58:55,995 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 10:58:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:58:56,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:58:56,050 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:58:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:58:56,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:58:56,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:58:56,098 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-07-01 10:58:56,104 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-01 10:58:56,105 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 228 states. Second operand 5 states. [2020-07-01 10:58:59,116 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 228 states.. Second operand 5 states. Result 1573 states and 4177 transitions. Complement of second has 14 states. [2020-07-01 10:58:59,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2020-07-01 10:58:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 10:58:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2670 transitions. [2020-07-01 10:58:59,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2670 transitions. Stem has 7 letters. Loop has 10 letters. [2020-07-01 10:58:59,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:58:59,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2670 transitions. Stem has 17 letters. Loop has 10 letters. [2020-07-01 10:58:59,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:58:59,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2670 transitions. Stem has 7 letters. Loop has 20 letters. [2020-07-01 10:58:59,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:58:59,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1573 states and 4177 transitions. [2020-07-01 10:58:59,185 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 763 [2020-07-01 10:58:59,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1573 states to 882 states and 2315 transitions. [2020-07-01 10:58:59,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 784 [2020-07-01 10:58:59,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 808 [2020-07-01 10:58:59,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 882 states and 2315 transitions. [2020-07-01 10:58:59,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:58:59,207 INFO L688 BuchiCegarLoop]: Abstraction has 882 states and 2315 transitions. [2020-07-01 10:58:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states and 2315 transitions. [2020-07-01 10:58:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 786. [2020-07-01 10:58:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-07-01 10:58:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2064 transitions. [2020-07-01 10:58:59,287 INFO L711 BuchiCegarLoop]: Abstraction has 786 states and 2064 transitions. [2020-07-01 10:58:59,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:58:59,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:58:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:58:59,291 INFO L87 Difference]: Start difference. First operand 786 states and 2064 transitions. Second operand 3 states. [2020-07-01 10:58:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:58:59,760 INFO L93 Difference]: Finished difference Result 786 states and 2063 transitions. [2020-07-01 10:58:59,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:58:59,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 786 states and 2063 transitions. [2020-07-01 10:58:59,786 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 690 [2020-07-01 10:58:59,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 786 states to 786 states and 2063 transitions. [2020-07-01 10:58:59,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 712 [2020-07-01 10:58:59,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 712 [2020-07-01 10:58:59,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 2063 transitions. [2020-07-01 10:58:59,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:58:59,795 INFO L688 BuchiCegarLoop]: Abstraction has 786 states and 2063 transitions. [2020-07-01 10:58:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 2063 transitions. [2020-07-01 10:58:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2020-07-01 10:58:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-07-01 10:58:59,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2063 transitions. [2020-07-01 10:58:59,814 INFO L711 BuchiCegarLoop]: Abstraction has 786 states and 2063 transitions. [2020-07-01 10:58:59,814 INFO L591 BuchiCegarLoop]: Abstraction has 786 states and 2063 transitions. [2020-07-01 10:58:59,815 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 10:58:59,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 786 states and 2063 transitions. [2020-07-01 10:58:59,820 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 690 [2020-07-01 10:58:59,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:58:59,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:58:59,821 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:58:59,821 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:58:59,821 INFO L794 eck$LassoCheckResult]: Stem: 3750#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 2 v_~c_write_req_ev~0_27) (= 0 v_~c_rsp_type~0_5) (= 0 v_~s_memory0~0_4) (= 0 v_~c_req_type~0_5) (= v_~rsp_tt_d~0_8 0) (= 0 v_~rsp_t_status~0_8) (= 0 v_~m_run_st~0_77) (= 0 v_~req_t_a~0_8) (= 1 v_~c_empty_rsp~0_12) (= 0 v_~c_rsp_d~0_5) (= 0 v_~rsp_tt_status~0_8) (= 0 v_~req_t_d~0_8) (= 1 v_~c_empty_req~0_12) (= 0 v_~s_run_st~0_33) (= 0 v_~d_t~0_14) (= 0 v_~rsp_t_status___0~0_6) (= 0 v_~req_t_a___0~0_6) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_t_type___0~0_6) (= 0 v_~rsp_t_d___0~0_6) (= 0 v_~a_t~0_14) (= 1 v_~m_run_i~0_5) (= 0 v_~m_run_pc~0_143) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_type~0_8) (= v_~s_run_pc~0_51 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_tt_type~0_8) (= 0 v_~rsp_t_d~0_8) (= 0 v_~c_req_d~0_5) (= 1 v_~s_run_i~0_5) (= 0 v_~req_t_d___0~0_6) (= 0 v_~req_t_type___0~0_6) (= 0 v_~req_t_type~0_8) (= v_~c_read_rsp_ev~0_27 2) (= 2 v_~c_read_req_ev~0_45) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~req_tt_d~0_8) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_tt_type~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~c_req_a~0_5)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 3713#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 3714#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= 1 v_~s_run_i~0_3) (= v_~s_run_st~0_3 0)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 3741#L1167-1 [1588] L1167-1-->L1173: Formula: (= 1 v_~m_run_pc~0_4) InVars {~m_run_pc~0=v_~m_run_pc~0_4} OutVars{~m_run_pc~0=v_~m_run_pc~0_4} AuxVars[] AssignedVars[] 3708#L1173 [1560] L1173-->L1212: Formula: (and (= 1 v_~c_m_ev~0_6) (= v_~m_run_st~0_5 0)) InVars {~c_m_ev~0=v_~c_m_ev~0_6} OutVars{~c_m_ev~0=v_~c_m_ev~0_6, ~m_run_st~0=v_~m_run_st~0_5} AuxVars[] AssignedVars[~m_run_st~0] 3709#L1212 [2111] L1212-->L1233: Formula: (< 2 v_~s_run_pc~0_7) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 3751#L1233 [2118] L1233-->L1328-1: Formula: (> v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 3752#L1328-1 [2020-07-01 10:58:59,822 INFO L796 eck$LassoCheckResult]: Loop: 3752#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 3731#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 3845#L1110 [2136] L1110-->L1114: Formula: (< 0 v_~m_run_st~0_17) InVars {~m_run_st~0=v_~m_run_st~0_17} OutVars{~m_run_st~0=v_~m_run_st~0_17} AuxVars[] AssignedVars[] 3986#L1114 [2142] L1114-->L1151: Formula: (< 0 v_~s_run_st~0_10) InVars {~s_run_st~0=v_~s_run_st~0_10} OutVars{~s_run_st~0=v_~s_run_st~0_10} AuxVars[] AssignedVars[] 3711#L1151 [1562] L1151-->L1253: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_5 3) InVars {} OutVars{ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_5} AuxVars[] AssignedVars[ULTIMATE.start_start_simulation_~kernel_st~0] 3703#L1253 [1542] L1253-->L1254: Formula: (= 1 v_~m_run_pc~0_60) InVars {~m_run_pc~0=v_~m_run_pc~0_60} OutVars{~m_run_pc~0=v_~m_run_pc~0_60} AuxVars[] AssignedVars[] 3576#L1254 [1449] L1254-->L1293: Formula: (and (= v_~m_run_st~0_31 0) (= 1 v_~c_m_ev~0_18)) InVars {~c_m_ev~0=v_~c_m_ev~0_18} OutVars{~c_m_ev~0=v_~c_m_ev~0_18, ~m_run_st~0=v_~m_run_st~0_31} AuxVars[] AssignedVars[~m_run_st~0] 3578#L1293 [2152] L1293-->L1314: Formula: (> v_~s_run_pc~0_22 2) InVars {~s_run_pc~0=v_~s_run_pc~0_22} OutVars{~s_run_pc~0=v_~s_run_pc~0_22} AuxVars[] AssignedVars[] 3794#L1314 [2164] L1314-->L1315: Formula: (> v_~s_run_pc~0_24 1) InVars {~s_run_pc~0=v_~s_run_pc~0_24} OutVars{~s_run_pc~0=v_~s_run_pc~0_24} AuxVars[] AssignedVars[] 4004#L1315 [1642] L1315-->L1328-1: Formula: (= 0 v_~m_run_st~0_42) InVars {~m_run_st~0=v_~m_run_st~0_42} OutVars{~m_run_st~0=v_~m_run_st~0_42} AuxVars[] AssignedVars[] 3752#L1328-1 [2020-07-01 10:58:59,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:58:59,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1068169552, now seen corresponding path program 1 times [2020-07-01 10:58:59,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:58:59,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705767889] [2020-07-01 10:58:59,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:58:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:58:59,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 10:58:59,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705767889] [2020-07-01 10:58:59,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:58:59,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:58:59,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533441724] [2020-07-01 10:58:59,857 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 10:58:59,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:58:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1184906646, now seen corresponding path program 2 times [2020-07-01 10:58:59,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:58:59,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859882987] [2020-07-01 10:58:59,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:58:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:58:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:58:59,872 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:58:59,925 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:58:59,925 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:58:59,925 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:58:59,925 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:58:59,925 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-01 10:58:59,925 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:58:59,926 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:58:59,926 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:58:59,926 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 10:58:59,926 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:58:59,926 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:58:59,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:59,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:59,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:59,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:59,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:59,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:59,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:59,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:59,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:58:59,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:59:00,036 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:59:00,037 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:59:00,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-01 10:59:00,046 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 10:59:00,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-01 10:59:00,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-01 10:59:00,127 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-01 10:59:00,129 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 10:59:00,129 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 10:59:00,129 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 10:59:00,129 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 10:59:00,129 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 10:59:00,130 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:59:00,130 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 10:59:00,130 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 10:59:00,130 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-07-01 10:59:00,130 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 10:59:00,130 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 10:59:00,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:59:00,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:59:00,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:59:00,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:59:00,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:59:00,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:59:00,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:59:00,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:59:00,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:59:00,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 10:59:00,225 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 10:59:00,225 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:59:00,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 10:59:00,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 10:59:00,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 10:59:00,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 10:59:00,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 10:59:00,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 10:59:00,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 10:59:00,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 10:59:00,237 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 10:59:00,241 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-01 10:59:00,241 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 10:59:00,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 10:59:00,244 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 10:59:00,244 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 10:59:00,245 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~m_run_st~0) = 1*~m_run_st~0 Supporting invariants [] [2020-07-01 10:59:00,275 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-01 10:59:00,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:59:00,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:59:00,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:59:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:59:00,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 10:59:00,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:59:00,334 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 10:59:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:59:00,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:59:00,358 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:59:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:59:00,373 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 10:59:00,373 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 10:59:00,396 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-07-01 10:59:00,397 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-01 10:59:00,397 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 786 states and 2063 transitions. cyclomatic complexity: 1281 Second operand 5 states. [2020-07-01 10:59:03,031 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 786 states and 2063 transitions. cyclomatic complexity: 1281. Second operand 5 states. Result 2131 states and 5630 transitions. Complement of second has 14 states. [2020-07-01 10:59:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2020-07-01 10:59:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 10:59:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2669 transitions. [2020-07-01 10:59:03,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2669 transitions. Stem has 7 letters. Loop has 10 letters. [2020-07-01 10:59:03,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:59:03,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2669 transitions. Stem has 17 letters. Loop has 10 letters. [2020-07-01 10:59:03,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:59:03,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 2669 transitions. Stem has 7 letters. Loop has 20 letters. [2020-07-01 10:59:03,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 10:59:03,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2131 states and 5630 transitions. [2020-07-01 10:59:03,068 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1244 [2020-07-01 10:59:03,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2131 states to 1440 states and 3768 transitions. [2020-07-01 10:59:03,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1268 [2020-07-01 10:59:03,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1292 [2020-07-01 10:59:03,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1440 states and 3768 transitions. [2020-07-01 10:59:03,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:59:03,084 INFO L688 BuchiCegarLoop]: Abstraction has 1440 states and 3768 transitions. [2020-07-01 10:59:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states and 3768 transitions. [2020-07-01 10:59:03,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 786. [2020-07-01 10:59:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-07-01 10:59:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2063 transitions. [2020-07-01 10:59:03,108 INFO L711 BuchiCegarLoop]: Abstraction has 786 states and 2063 transitions. [2020-07-01 10:59:03,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:59:03,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:59:03,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:59:03,108 INFO L87 Difference]: Start difference. First operand 786 states and 2063 transitions. Second operand 3 states. [2020-07-01 10:59:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:59:03,898 INFO L93 Difference]: Finished difference Result 1200 states and 2672 transitions. [2020-07-01 10:59:03,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:59:03,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1200 states and 2672 transitions. [2020-07-01 10:59:03,923 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1128 [2020-07-01 10:59:03,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1200 states to 1200 states and 2672 transitions. [2020-07-01 10:59:03,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1144 [2020-07-01 10:59:03,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1144 [2020-07-01 10:59:03,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1200 states and 2672 transitions. [2020-07-01 10:59:03,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:59:03,934 INFO L688 BuchiCegarLoop]: Abstraction has 1200 states and 2672 transitions. [2020-07-01 10:59:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states and 2672 transitions. [2020-07-01 10:59:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1200. [2020-07-01 10:59:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2020-07-01 10:59:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 2672 transitions. [2020-07-01 10:59:03,960 INFO L711 BuchiCegarLoop]: Abstraction has 1200 states and 2672 transitions. [2020-07-01 10:59:03,960 INFO L591 BuchiCegarLoop]: Abstraction has 1200 states and 2672 transitions. [2020-07-01 10:59:03,960 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 10:59:03,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1200 states and 2672 transitions. [2020-07-01 10:59:03,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1128 [2020-07-01 10:59:03,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:59:03,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:59:03,966 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:59:03,967 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:59:03,967 INFO L794 eck$LassoCheckResult]: Stem: 8788#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 2 v_~c_write_req_ev~0_27) (= 0 v_~c_rsp_type~0_5) (= 0 v_~s_memory0~0_4) (= 0 v_~c_req_type~0_5) (= v_~rsp_tt_d~0_8 0) (= 0 v_~rsp_t_status~0_8) (= 0 v_~m_run_st~0_77) (= 0 v_~req_t_a~0_8) (= 1 v_~c_empty_rsp~0_12) (= 0 v_~c_rsp_d~0_5) (= 0 v_~rsp_tt_status~0_8) (= 0 v_~req_t_d~0_8) (= 1 v_~c_empty_req~0_12) (= 0 v_~s_run_st~0_33) (= 0 v_~d_t~0_14) (= 0 v_~rsp_t_status___0~0_6) (= 0 v_~req_t_a___0~0_6) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_t_type___0~0_6) (= 0 v_~rsp_t_d___0~0_6) (= 0 v_~a_t~0_14) (= 1 v_~m_run_i~0_5) (= 0 v_~m_run_pc~0_143) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_type~0_8) (= v_~s_run_pc~0_51 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_tt_type~0_8) (= 0 v_~rsp_t_d~0_8) (= 0 v_~c_req_d~0_5) (= 1 v_~s_run_i~0_5) (= 0 v_~req_t_d___0~0_6) (= 0 v_~req_t_type___0~0_6) (= 0 v_~req_t_type~0_8) (= v_~c_read_rsp_ev~0_27 2) (= 2 v_~c_read_req_ev~0_45) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~req_tt_d~0_8) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_tt_type~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~c_req_a~0_5)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 8747#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 8748#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= 1 v_~s_run_i~0_3) (= v_~s_run_st~0_3 0)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 8779#L1167-1 [2105] L1167-1-->L1179: Formula: (> 1 v_~m_run_pc~0_6) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 8780#L1179 [2109] L1179-->L1187: Formula: (> 2 v_~m_run_pc~0_10) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 8706#L1187 [2115] L1187-->L1195: Formula: (> 3 v_~m_run_pc~0_14) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 8707#L1195 [2123] L1195-->L1203: Formula: (> 4 v_~m_run_pc~0_18) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 8744#L1203 [2129] L1203-->L1211: Formula: (> 5 v_~m_run_pc~0_22) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 8792#L1211 [2132] L1211-->L1212: Formula: (> 6 v_~m_run_pc~0_26) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 8793#L1212 [1759] L1212-->L1227: Formula: (= 2 v_~s_run_pc~0_5) InVars {~s_run_pc~0=v_~s_run_pc~0_5} OutVars{~s_run_pc~0=v_~s_run_pc~0_5} AuxVars[] AssignedVars[] 8829#L1227 [1652] L1227-->L1328-1: Formula: (and (= v_~s_run_st~0_6 0) (= 1 v_~c_write_req_ev~0_5)) InVars {~c_write_req_ev~0=v_~c_write_req_ev~0_5} OutVars{~s_run_st~0=v_~s_run_st~0_6, ~c_write_req_ev~0=v_~c_write_req_ev~0_5} AuxVars[] AssignedVars[~s_run_st~0] 8830#L1328-1 [2020-07-01 10:59:03,967 INFO L796 eck$LassoCheckResult]: Loop: 8830#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 8768#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 8713#L1110 [2136] L1110-->L1114: Formula: (< 0 v_~m_run_st~0_17) InVars {~m_run_st~0=v_~m_run_st~0_17} OutVars{~m_run_st~0=v_~m_run_st~0_17} AuxVars[] AssignedVars[] 8715#L1114 [2142] L1114-->L1151: Formula: (< 0 v_~s_run_st~0_10) InVars {~s_run_st~0=v_~s_run_st~0_10} OutVars{~s_run_st~0=v_~s_run_st~0_10} AuxVars[] AssignedVars[] 8745#L1151 [1562] L1151-->L1253: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_5 3) InVars {} OutVars{ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_5} AuxVars[] AssignedVars[ULTIMATE.start_start_simulation_~kernel_st~0] 8734#L1253 [2138] L1253-->L1260: Formula: (> 1 v_~m_run_pc~0_63) InVars {~m_run_pc~0=v_~m_run_pc~0_63} OutVars{~m_run_pc~0=v_~m_run_pc~0_63} AuxVars[] AssignedVars[] 8735#L1260 [2147] L1260-->L1268: Formula: (> 2 v_~m_run_pc~0_67) InVars {~m_run_pc~0=v_~m_run_pc~0_67} OutVars{~m_run_pc~0=v_~m_run_pc~0_67} AuxVars[] AssignedVars[] 8827#L1268 [2157] L1268-->L1276: Formula: (> 3 v_~m_run_pc~0_71) InVars {~m_run_pc~0=v_~m_run_pc~0_71} OutVars{~m_run_pc~0=v_~m_run_pc~0_71} AuxVars[] AssignedVars[] 8609#L1276 [2168] L1276-->L1284: Formula: (> 4 v_~m_run_pc~0_74) InVars {~m_run_pc~0=v_~m_run_pc~0_74} OutVars{~m_run_pc~0=v_~m_run_pc~0_74} AuxVars[] AssignedVars[] 8610#L1284 [2180] L1284-->L1292: Formula: (> 5 v_~m_run_pc~0_76) InVars {~m_run_pc~0=v_~m_run_pc~0_76} OutVars{~m_run_pc~0=v_~m_run_pc~0_76} AuxVars[] AssignedVars[] 8671#L1292 [2191] L1292-->L1293: Formula: (> 6 v_~m_run_pc~0_78) InVars {~m_run_pc~0=v_~m_run_pc~0_78} OutVars{~m_run_pc~0=v_~m_run_pc~0_78} AuxVars[] AssignedVars[] 8672#L1293 [2152] L1293-->L1314: Formula: (> v_~s_run_pc~0_22 2) InVars {~s_run_pc~0=v_~s_run_pc~0_22} OutVars{~s_run_pc~0=v_~s_run_pc~0_22} AuxVars[] AssignedVars[] 9657#L1314 [2164] L1314-->L1315: Formula: (> v_~s_run_pc~0_24 1) InVars {~s_run_pc~0=v_~s_run_pc~0_24} OutVars{~s_run_pc~0=v_~s_run_pc~0_24} AuxVars[] AssignedVars[] 9655#L1315 [1642] L1315-->L1328-1: Formula: (= 0 v_~m_run_st~0_42) InVars {~m_run_st~0=v_~m_run_st~0_42} OutVars{~m_run_st~0=v_~m_run_st~0_42} AuxVars[] AssignedVars[] 8830#L1328-1 [2020-07-01 10:59:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:03,968 INFO L82 PathProgramCache]: Analyzing trace with hash 848339017, now seen corresponding path program 1 times [2020-07-01 10:59:03,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:03,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146788739] [2020-07-01 10:59:03,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:59:04,000 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 10:59:04,000 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146788739] [2020-07-01 10:59:04,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:59:04,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:59:04,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31635044] [2020-07-01 10:59:04,001 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 10:59:04,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:04,001 INFO L82 PathProgramCache]: Analyzing trace with hash -155792198, now seen corresponding path program 1 times [2020-07-01 10:59:04,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:04,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48744968] [2020-07-01 10:59:04,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:59:04,028 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 10:59:04,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48744968] [2020-07-01 10:59:04,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:59:04,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:59:04,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002123428] [2020-07-01 10:59:04,029 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 10:59:04,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:59:04,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:59:04,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:59:04,030 INFO L87 Difference]: Start difference. First operand 1200 states and 2672 transitions. cyclomatic complexity: 1476 Second operand 3 states. [2020-07-01 10:59:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:59:04,752 INFO L93 Difference]: Finished difference Result 1568 states and 3198 transitions. [2020-07-01 10:59:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:59:04,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1568 states and 3198 transitions. [2020-07-01 10:59:04,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1450 [2020-07-01 10:59:04,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1568 states to 1568 states and 3198 transitions. [2020-07-01 10:59:04,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1464 [2020-07-01 10:59:04,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1464 [2020-07-01 10:59:04,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1568 states and 3198 transitions. [2020-07-01 10:59:04,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:59:04,791 INFO L688 BuchiCegarLoop]: Abstraction has 1568 states and 3198 transitions. [2020-07-01 10:59:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states and 3198 transitions. [2020-07-01 10:59:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2020-07-01 10:59:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-07-01 10:59:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 3198 transitions. [2020-07-01 10:59:04,820 INFO L711 BuchiCegarLoop]: Abstraction has 1568 states and 3198 transitions. [2020-07-01 10:59:04,820 INFO L591 BuchiCegarLoop]: Abstraction has 1568 states and 3198 transitions. [2020-07-01 10:59:04,821 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 10:59:04,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1568 states and 3198 transitions. [2020-07-01 10:59:04,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1450 [2020-07-01 10:59:04,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:59:04,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:59:04,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:59:04,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 10:59:04,829 INFO L794 eck$LassoCheckResult]: Stem: 11566#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 2 v_~c_write_req_ev~0_27) (= 0 v_~c_rsp_type~0_5) (= 0 v_~s_memory0~0_4) (= 0 v_~c_req_type~0_5) (= v_~rsp_tt_d~0_8 0) (= 0 v_~rsp_t_status~0_8) (= 0 v_~m_run_st~0_77) (= 0 v_~req_t_a~0_8) (= 1 v_~c_empty_rsp~0_12) (= 0 v_~c_rsp_d~0_5) (= 0 v_~rsp_tt_status~0_8) (= 0 v_~req_t_d~0_8) (= 1 v_~c_empty_req~0_12) (= 0 v_~s_run_st~0_33) (= 0 v_~d_t~0_14) (= 0 v_~rsp_t_status___0~0_6) (= 0 v_~req_t_a___0~0_6) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_t_type___0~0_6) (= 0 v_~rsp_t_d___0~0_6) (= 0 v_~a_t~0_14) (= 1 v_~m_run_i~0_5) (= 0 v_~m_run_pc~0_143) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_type~0_8) (= v_~s_run_pc~0_51 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_tt_type~0_8) (= 0 v_~rsp_t_d~0_8) (= 0 v_~c_req_d~0_5) (= 1 v_~s_run_i~0_5) (= 0 v_~req_t_d___0~0_6) (= 0 v_~req_t_type___0~0_6) (= 0 v_~req_t_type~0_8) (= v_~c_read_rsp_ev~0_27 2) (= 2 v_~c_read_req_ev~0_45) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~req_tt_d~0_8) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_tt_type~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~c_req_a~0_5)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 11525#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 11526#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= 1 v_~s_run_i~0_3) (= v_~s_run_st~0_3 0)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 11556#L1167-1 [2105] L1167-1-->L1179: Formula: (> 1 v_~m_run_pc~0_6) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 11557#L1179 [2109] L1179-->L1187: Formula: (> 2 v_~m_run_pc~0_10) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 11471#L1187 [2115] L1187-->L1195: Formula: (> 3 v_~m_run_pc~0_14) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 11472#L1195 [2123] L1195-->L1203: Formula: (> 4 v_~m_run_pc~0_18) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 11522#L1203 [2129] L1203-->L1211: Formula: (> 5 v_~m_run_pc~0_22) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 11570#L1211 [2132] L1211-->L1212: Formula: (> 6 v_~m_run_pc~0_26) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 11571#L1212 [2110] L1212-->L1233: Formula: (> 2 v_~s_run_pc~0_7) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 11568#L1233 [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 11569#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 11786#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12640#L1110 [1521] L1110-->L1114-1: Formula: (= 0 v_~m_run_st~0_16) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 12392#L1114-1 [2020-07-01 10:59:04,829 INFO L796 eck$LassoCheckResult]: Loop: 12392#L1114-1 [2140] L1114-1-->L1120: Formula: (> 0 v_~m_run_st~0_76) InVars {~m_run_st~0=v_~m_run_st~0_76} OutVars{~m_run_st~0=v_~m_run_st~0_76} AuxVars[] AssignedVars[] 11731#L1120 [2150] L1120-->L1135: Formula: (> 0 v_~s_run_st~0_14) InVars {~s_run_st~0=v_~s_run_st~0_14} OutVars{~s_run_st~0=v_~s_run_st~0_14} AuxVars[] AssignedVars[] 12674#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 12517#L1110 [1521] L1110-->L1114-1: Formula: (= 0 v_~m_run_st~0_16) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 12392#L1114-1 [2020-07-01 10:59:04,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1620604262, now seen corresponding path program 1 times [2020-07-01 10:59:04,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:04,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054569968] [2020-07-01 10:59:04,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:04,858 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:59:04,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:04,858 INFO L82 PathProgramCache]: Analyzing trace with hash 66798771, now seen corresponding path program 1 times [2020-07-01 10:59:04,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:04,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617092877] [2020-07-01 10:59:04,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:59:04,872 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 10:59:04,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617092877] [2020-07-01 10:59:04,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:59:04,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 10:59:04,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528271235] [2020-07-01 10:59:04,873 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 10:59:04,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:59:04,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:59:04,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:59:04,874 INFO L87 Difference]: Start difference. First operand 1568 states and 3198 transitions. cyclomatic complexity: 1633 Second operand 3 states. [2020-07-01 10:59:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:59:05,535 INFO L93 Difference]: Finished difference Result 1752 states and 3578 transitions. [2020-07-01 10:59:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:59:05,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1752 states and 3578 transitions. [2020-07-01 10:59:05,561 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1634 [2020-07-01 10:59:05,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1752 states to 1752 states and 3578 transitions. [2020-07-01 10:59:05,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1648 [2020-07-01 10:59:05,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1648 [2020-07-01 10:59:05,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1752 states and 3578 transitions. [2020-07-01 10:59:05,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:59:05,575 INFO L688 BuchiCegarLoop]: Abstraction has 1752 states and 3578 transitions. [2020-07-01 10:59:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states and 3578 transitions. [2020-07-01 10:59:05,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2020-07-01 10:59:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2020-07-01 10:59:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 3578 transitions. [2020-07-01 10:59:05,606 INFO L711 BuchiCegarLoop]: Abstraction has 1752 states and 3578 transitions. [2020-07-01 10:59:05,606 INFO L591 BuchiCegarLoop]: Abstraction has 1752 states and 3578 transitions. [2020-07-01 10:59:05,606 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 10:59:05,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1752 states and 3578 transitions. [2020-07-01 10:59:05,615 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1634 [2020-07-01 10:59:05,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:59:05,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:59:05,616 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:59:05,616 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 10:59:05,616 INFO L794 eck$LassoCheckResult]: Stem: 14897#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 2 v_~c_write_req_ev~0_27) (= 0 v_~c_rsp_type~0_5) (= 0 v_~s_memory0~0_4) (= 0 v_~c_req_type~0_5) (= v_~rsp_tt_d~0_8 0) (= 0 v_~rsp_t_status~0_8) (= 0 v_~m_run_st~0_77) (= 0 v_~req_t_a~0_8) (= 1 v_~c_empty_rsp~0_12) (= 0 v_~c_rsp_d~0_5) (= 0 v_~rsp_tt_status~0_8) (= 0 v_~req_t_d~0_8) (= 1 v_~c_empty_req~0_12) (= 0 v_~s_run_st~0_33) (= 0 v_~d_t~0_14) (= 0 v_~rsp_t_status___0~0_6) (= 0 v_~req_t_a___0~0_6) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_t_type___0~0_6) (= 0 v_~rsp_t_d___0~0_6) (= 0 v_~a_t~0_14) (= 1 v_~m_run_i~0_5) (= 0 v_~m_run_pc~0_143) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_type~0_8) (= v_~s_run_pc~0_51 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_tt_type~0_8) (= 0 v_~rsp_t_d~0_8) (= 0 v_~c_req_d~0_5) (= 1 v_~s_run_i~0_5) (= 0 v_~req_t_d___0~0_6) (= 0 v_~req_t_type___0~0_6) (= 0 v_~req_t_type~0_8) (= v_~c_read_rsp_ev~0_27 2) (= 2 v_~c_read_req_ev~0_45) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~req_tt_d~0_8) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_tt_type~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~c_req_a~0_5)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 14858#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 14859#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= 1 v_~s_run_i~0_3) (= v_~s_run_st~0_3 0)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 14887#L1167-1 [2105] L1167-1-->L1179: Formula: (> 1 v_~m_run_pc~0_6) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 14888#L1179 [2109] L1179-->L1187: Formula: (> 2 v_~m_run_pc~0_10) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 14801#L1187 [2115] L1187-->L1195: Formula: (> 3 v_~m_run_pc~0_14) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 14802#L1195 [2123] L1195-->L1203: Formula: (> 4 v_~m_run_pc~0_18) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 14855#L1203 [2129] L1203-->L1211: Formula: (> 5 v_~m_run_pc~0_22) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 14902#L1211 [2132] L1211-->L1212: Formula: (> 6 v_~m_run_pc~0_26) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 14903#L1212 [2110] L1212-->L1233: Formula: (> 2 v_~s_run_pc~0_7) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 14900#L1233 [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 14901#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 15130#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16244#L1110 [1521] L1110-->L1114-1: Formula: (= 0 v_~m_run_st~0_16) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 16001#L1114-1 [2020-07-01 10:59:05,617 INFO L796 eck$LassoCheckResult]: Loop: 16001#L1114-1 [1872] L1114-1-->L1124: Formula: (and (= v_ULTIMATE.start_eval_~tmp~0_3 |v_ULTIMATE.start_eval_#t~nondet1_3|) (= 0 v_~m_run_st~0_18)) InVars {~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_3|} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_3, ~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0] 15003#L1124 [1739] L1124-->L1120: Formula: (= 0 v_ULTIMATE.start_eval_~tmp~0_5) InVars {ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} AuxVars[] AssignedVars[] 15004#L1120 [2150] L1120-->L1135: Formula: (> 0 v_~s_run_st~0_14) InVars {~s_run_st~0=v_~s_run_st~0_14} OutVars{~s_run_st~0=v_~s_run_st~0_14} AuxVars[] AssignedVars[] 16117#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 16220#L1110 [1521] L1110-->L1114-1: Formula: (= 0 v_~m_run_st~0_16) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 16001#L1114-1 [2020-07-01 10:59:05,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1620604262, now seen corresponding path program 2 times [2020-07-01 10:59:05,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:05,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343910293] [2020-07-01 10:59:05,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:05,640 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:59:05,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:05,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1811389522, now seen corresponding path program 1 times [2020-07-01 10:59:05,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:05,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250720307] [2020-07-01 10:59:05,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:05,651 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:59:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash -38158835, now seen corresponding path program 1 times [2020-07-01 10:59:05,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:05,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373039905] [2020-07-01 10:59:05,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:59:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:59:05,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373039905] [2020-07-01 10:59:05,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:59:05,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 10:59:05,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621156594] [2020-07-01 10:59:05,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:59:05,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:59:05,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:59:05,701 INFO L87 Difference]: Start difference. First operand 1752 states and 3578 transitions. cyclomatic complexity: 1830 Second operand 3 states. [2020-07-01 10:59:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:59:06,104 INFO L93 Difference]: Finished difference Result 1752 states and 3550 transitions. [2020-07-01 10:59:06,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:59:06,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1752 states and 3550 transitions. [2020-07-01 10:59:06,129 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1634 [2020-07-01 10:59:06,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1752 states to 1752 states and 3550 transitions. [2020-07-01 10:59:06,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1648 [2020-07-01 10:59:06,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1648 [2020-07-01 10:59:06,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1752 states and 3550 transitions. [2020-07-01 10:59:06,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:59:06,142 INFO L688 BuchiCegarLoop]: Abstraction has 1752 states and 3550 transitions. [2020-07-01 10:59:06,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states and 3550 transitions. [2020-07-01 10:59:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2020-07-01 10:59:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2020-07-01 10:59:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 3550 transitions. [2020-07-01 10:59:06,169 INFO L711 BuchiCegarLoop]: Abstraction has 1752 states and 3550 transitions. [2020-07-01 10:59:06,169 INFO L591 BuchiCegarLoop]: Abstraction has 1752 states and 3550 transitions. [2020-07-01 10:59:06,169 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 10:59:06,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1752 states and 3550 transitions. [2020-07-01 10:59:06,176 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1634 [2020-07-01 10:59:06,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:59:06,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:59:06,177 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:59:06,177 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 10:59:06,177 INFO L794 eck$LassoCheckResult]: Stem: 18406#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 2 v_~c_write_req_ev~0_27) (= 0 v_~c_rsp_type~0_5) (= 0 v_~s_memory0~0_4) (= 0 v_~c_req_type~0_5) (= v_~rsp_tt_d~0_8 0) (= 0 v_~rsp_t_status~0_8) (= 0 v_~m_run_st~0_77) (= 0 v_~req_t_a~0_8) (= 1 v_~c_empty_rsp~0_12) (= 0 v_~c_rsp_d~0_5) (= 0 v_~rsp_tt_status~0_8) (= 0 v_~req_t_d~0_8) (= 1 v_~c_empty_req~0_12) (= 0 v_~s_run_st~0_33) (= 0 v_~d_t~0_14) (= 0 v_~rsp_t_status___0~0_6) (= 0 v_~req_t_a___0~0_6) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_t_type___0~0_6) (= 0 v_~rsp_t_d___0~0_6) (= 0 v_~a_t~0_14) (= 1 v_~m_run_i~0_5) (= 0 v_~m_run_pc~0_143) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_type~0_8) (= v_~s_run_pc~0_51 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_tt_type~0_8) (= 0 v_~rsp_t_d~0_8) (= 0 v_~c_req_d~0_5) (= 1 v_~s_run_i~0_5) (= 0 v_~req_t_d___0~0_6) (= 0 v_~req_t_type___0~0_6) (= 0 v_~req_t_type~0_8) (= v_~c_read_rsp_ev~0_27 2) (= 2 v_~c_read_req_ev~0_45) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~req_tt_d~0_8) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_tt_type~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~c_req_a~0_5)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 18364#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 18365#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= 1 v_~s_run_i~0_3) (= v_~s_run_st~0_3 0)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 18396#L1167-1 [2105] L1167-1-->L1179: Formula: (> 1 v_~m_run_pc~0_6) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 18397#L1179 [2109] L1179-->L1187: Formula: (> 2 v_~m_run_pc~0_10) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 18309#L1187 [2115] L1187-->L1195: Formula: (> 3 v_~m_run_pc~0_14) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 18310#L1195 [2123] L1195-->L1203: Formula: (> 4 v_~m_run_pc~0_18) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 18360#L1203 [2129] L1203-->L1211: Formula: (> 5 v_~m_run_pc~0_22) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 18410#L1211 [2132] L1211-->L1212: Formula: (> 6 v_~m_run_pc~0_26) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 18411#L1212 [2110] L1212-->L1233: Formula: (> 2 v_~s_run_pc~0_7) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 18408#L1233 [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 18409#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 18619#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 19927#L1110 [1521] L1110-->L1114-1: Formula: (= 0 v_~m_run_st~0_16) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 19487#L1114-1 [2020-07-01 10:59:06,177 INFO L796 eck$LassoCheckResult]: Loop: 19487#L1114-1 [1872] L1114-1-->L1124: Formula: (and (= v_ULTIMATE.start_eval_~tmp~0_3 |v_ULTIMATE.start_eval_#t~nondet1_3|) (= 0 v_~m_run_st~0_18)) InVars {~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_3|} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_3, ~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0] 18505#L1124 [1739] L1124-->L1120: Formula: (= 0 v_ULTIMATE.start_eval_~tmp~0_5) InVars {ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} AuxVars[] AssignedVars[] 18506#L1120 [2151] L1120-->L1135: Formula: (< 0 v_~s_run_st~0_14) InVars {~s_run_st~0=v_~s_run_st~0_14} OutVars{~s_run_st~0=v_~s_run_st~0_14} AuxVars[] AssignedVars[] 19629#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 19610#L1110 [1521] L1110-->L1114-1: Formula: (= 0 v_~m_run_st~0_16) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 19487#L1114-1 [2020-07-01 10:59:06,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1620604262, now seen corresponding path program 3 times [2020-07-01 10:59:06,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:06,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672889228] [2020-07-01 10:59:06,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:06,196 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:59:06,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:06,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1811390483, now seen corresponding path program 1 times [2020-07-01 10:59:06,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:06,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853443866] [2020-07-01 10:59:06,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:06,203 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:59:06,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:06,204 INFO L82 PathProgramCache]: Analyzing trace with hash -38157874, now seen corresponding path program 1 times [2020-07-01 10:59:06,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:06,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810927414] [2020-07-01 10:59:06,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:59:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 10:59:06,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810927414] [2020-07-01 10:59:06,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:59:06,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 10:59:06,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954425723] [2020-07-01 10:59:06,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:59:06,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:59:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:59:06,245 INFO L87 Difference]: Start difference. First operand 1752 states and 3550 transitions. cyclomatic complexity: 1802 Second operand 3 states. [2020-07-01 10:59:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:59:07,002 INFO L93 Difference]: Finished difference Result 3240 states and 6540 transitions. [2020-07-01 10:59:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:59:07,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3240 states and 6540 transitions. [2020-07-01 10:59:07,030 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3021 [2020-07-01 10:59:07,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3240 states to 3240 states and 6540 transitions. [2020-07-01 10:59:07,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3070 [2020-07-01 10:59:07,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3070 [2020-07-01 10:59:07,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3240 states and 6540 transitions. [2020-07-01 10:59:07,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:59:07,052 INFO L688 BuchiCegarLoop]: Abstraction has 3240 states and 6540 transitions. [2020-07-01 10:59:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states and 6540 transitions. [2020-07-01 10:59:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 2695. [2020-07-01 10:59:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2020-07-01 10:59:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 5451 transitions. [2020-07-01 10:59:07,098 INFO L711 BuchiCegarLoop]: Abstraction has 2695 states and 5451 transitions. [2020-07-01 10:59:07,098 INFO L591 BuchiCegarLoop]: Abstraction has 2695 states and 5451 transitions. [2020-07-01 10:59:07,098 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 10:59:07,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2695 states and 5451 transitions. [2020-07-01 10:59:07,105 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2535 [2020-07-01 10:59:07,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:59:07,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:59:07,106 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:59:07,106 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 10:59:07,107 INFO L794 eck$LassoCheckResult]: Stem: 23410#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 2 v_~c_write_req_ev~0_27) (= 0 v_~c_rsp_type~0_5) (= 0 v_~s_memory0~0_4) (= 0 v_~c_req_type~0_5) (= v_~rsp_tt_d~0_8 0) (= 0 v_~rsp_t_status~0_8) (= 0 v_~m_run_st~0_77) (= 0 v_~req_t_a~0_8) (= 1 v_~c_empty_rsp~0_12) (= 0 v_~c_rsp_d~0_5) (= 0 v_~rsp_tt_status~0_8) (= 0 v_~req_t_d~0_8) (= 1 v_~c_empty_req~0_12) (= 0 v_~s_run_st~0_33) (= 0 v_~d_t~0_14) (= 0 v_~rsp_t_status___0~0_6) (= 0 v_~req_t_a___0~0_6) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_t_type___0~0_6) (= 0 v_~rsp_t_d___0~0_6) (= 0 v_~a_t~0_14) (= 1 v_~m_run_i~0_5) (= 0 v_~m_run_pc~0_143) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_type~0_8) (= v_~s_run_pc~0_51 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_tt_type~0_8) (= 0 v_~rsp_t_d~0_8) (= 0 v_~c_req_d~0_5) (= 1 v_~s_run_i~0_5) (= 0 v_~req_t_d___0~0_6) (= 0 v_~req_t_type___0~0_6) (= 0 v_~req_t_type~0_8) (= v_~c_read_rsp_ev~0_27 2) (= 2 v_~c_read_req_ev~0_45) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~req_tt_d~0_8) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_tt_type~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~c_req_a~0_5)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 23367#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 23368#L1162-2 [2102] L1162-2-->L1167-1: Formula: (and (= v_~s_run_st~0_4 2) (< 1 v_~s_run_i~0_4)) InVars {~s_run_i~0=v_~s_run_i~0_4} OutVars{~s_run_st~0=v_~s_run_st~0_4, ~s_run_i~0=v_~s_run_i~0_4} AuxVars[] AssignedVars[~s_run_st~0] 23568#L1167-1 [2105] L1167-1-->L1179: Formula: (> 1 v_~m_run_pc~0_6) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 23643#L1179 [2109] L1179-->L1187: Formula: (> 2 v_~m_run_pc~0_10) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 23642#L1187 [2115] L1187-->L1195: Formula: (> 3 v_~m_run_pc~0_14) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 23641#L1195 [2123] L1195-->L1203: Formula: (> 4 v_~m_run_pc~0_18) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 23640#L1203 [2129] L1203-->L1211: Formula: (> 5 v_~m_run_pc~0_22) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 23639#L1211 [2132] L1211-->L1212: Formula: (> 6 v_~m_run_pc~0_26) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 23638#L1212 [2110] L1212-->L1233: Formula: (> 2 v_~s_run_pc~0_7) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 23637#L1233 [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 23635#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 23636#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 25662#L1110 [1521] L1110-->L1114-1: Formula: (= 0 v_~m_run_st~0_16) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 24878#L1114-1 [2020-07-01 10:59:07,107 INFO L796 eck$LassoCheckResult]: Loop: 24878#L1114-1 [1872] L1114-1-->L1124: Formula: (and (= v_ULTIMATE.start_eval_~tmp~0_3 |v_ULTIMATE.start_eval_#t~nondet1_3|) (= 0 v_~m_run_st~0_18)) InVars {~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_3|} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_3, ~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0] 24875#L1124 [1739] L1124-->L1120: Formula: (= 0 v_ULTIMATE.start_eval_~tmp~0_5) InVars {ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} AuxVars[] AssignedVars[] 24876#L1120 [2151] L1120-->L1135: Formula: (< 0 v_~s_run_st~0_14) InVars {~s_run_st~0=v_~s_run_st~0_14} OutVars{~s_run_st~0=v_~s_run_st~0_14} AuxVars[] AssignedVars[] 25385#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 24881#L1110 [1521] L1110-->L1114-1: Formula: (= 0 v_~m_run_st~0_16) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 24878#L1114-1 [2020-07-01 10:59:07,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2077962455, now seen corresponding path program 1 times [2020-07-01 10:59:07,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:07,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667706046] [2020-07-01 10:59:07,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 10:59:07,121 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 10:59:07,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667706046] [2020-07-01 10:59:07,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 10:59:07,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 10:59:07,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858776938] [2020-07-01 10:59:07,123 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 10:59:07,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:07,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1811390483, now seen corresponding path program 2 times [2020-07-01 10:59:07,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:07,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213101102] [2020-07-01 10:59:07,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:07,130 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:59:07,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 10:59:07,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 10:59:07,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 10:59:07,151 INFO L87 Difference]: Start difference. First operand 2695 states and 5451 transitions. cyclomatic complexity: 2760 Second operand 3 states. [2020-07-01 10:59:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 10:59:07,527 INFO L93 Difference]: Finished difference Result 2662 states and 5412 transitions. [2020-07-01 10:59:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 10:59:07,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2662 states and 5412 transitions. [2020-07-01 10:59:07,553 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2535 [2020-07-01 10:59:07,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2662 states to 2662 states and 5412 transitions. [2020-07-01 10:59:07,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2563 [2020-07-01 10:59:07,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2563 [2020-07-01 10:59:07,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2662 states and 5412 transitions. [2020-07-01 10:59:07,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 10:59:07,574 INFO L688 BuchiCegarLoop]: Abstraction has 2662 states and 5412 transitions. [2020-07-01 10:59:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states and 5412 transitions. [2020-07-01 10:59:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2662. [2020-07-01 10:59:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. [2020-07-01 10:59:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 5412 transitions. [2020-07-01 10:59:07,611 INFO L711 BuchiCegarLoop]: Abstraction has 2662 states and 5412 transitions. [2020-07-01 10:59:07,611 INFO L591 BuchiCegarLoop]: Abstraction has 2662 states and 5412 transitions. [2020-07-01 10:59:07,611 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-01 10:59:07,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2662 states and 5412 transitions. [2020-07-01 10:59:07,618 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2535 [2020-07-01 10:59:07,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 10:59:07,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 10:59:07,619 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 10:59:07,619 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 10:59:07,620 INFO L794 eck$LassoCheckResult]: Stem: 28771#ULTIMATE.startENTRY [2490] ULTIMATE.startENTRY-->L1162: Formula: (and (= 2 v_~c_write_req_ev~0_27) (= 0 v_~c_rsp_type~0_5) (= 0 v_~s_memory0~0_4) (= 0 v_~c_req_type~0_5) (= v_~rsp_tt_d~0_8 0) (= 0 v_~rsp_t_status~0_8) (= 0 v_~m_run_st~0_77) (= 0 v_~req_t_a~0_8) (= 1 v_~c_empty_rsp~0_12) (= 0 v_~c_rsp_d~0_5) (= 0 v_~rsp_tt_status~0_8) (= 0 v_~req_t_d~0_8) (= 1 v_~c_empty_req~0_12) (= 0 v_~s_run_st~0_33) (= 0 v_~d_t~0_14) (= 0 v_~rsp_t_status___0~0_6) (= 0 v_~req_t_a___0~0_6) (= 0 v_~c_m_lock~0_16) (= 0 v_~rsp_t_type___0~0_6) (= 0 v_~rsp_t_d___0~0_6) (= 0 v_~a_t~0_14) (= 1 v_~m_run_i~0_5) (= 0 v_~m_run_pc~0_143) (= 0 v_~c_rsp_status~0_5) (= 0 v_~rsp_t_type~0_8) (= v_~s_run_pc~0_51 0) (= 2 v_~c_m_ev~0_48) (= 0 v_~req_tt_type~0_8) (= 0 v_~rsp_t_d~0_8) (= 0 v_~c_req_d~0_5) (= 1 v_~s_run_i~0_5) (= 0 v_~req_t_d___0~0_6) (= 0 v_~req_t_type___0~0_6) (= 0 v_~req_t_type~0_8) (= v_~c_read_rsp_ev~0_27 2) (= 2 v_~c_read_req_ev~0_45) (= v_ULTIMATE.start_start_simulation_~kernel_st~0_7 0) (= 0 v_~req_tt_d~0_8) (= 0 v_~req_tt_a~0_8) (= 0 v_~rsp_tt_type~0_8) (= 2 v_~c_write_rsp_ev~0_45) (= 0 v_~c_req_a~0_5)) InVars {} OutVars{~c_empty_rsp~0=v_~c_empty_rsp~0_12, ~s_memory0~0=v_~s_memory0~0_4, ~m_run_st~0=v_~m_run_st~0_77, ~c_write_rsp_ev~0=v_~c_write_rsp_ev~0_45, ~c_m_ev~0=v_~c_m_ev~0_48, ~rsp_tt_status~0=v_~rsp_tt_status~0_8, ~rsp_t_type~0=v_~rsp_t_type~0_8, ~req_t_a~0=v_~req_t_a~0_8, ~s_run_pc~0=v_~s_run_pc~0_51, ~c_write_req_ev~0=v_~c_write_req_ev~0_27, ~m_run_i~0=v_~m_run_i~0_5, ~c_read_req_ev~0=v_~c_read_req_ev~0_45, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_7, ~c_empty_req~0=v_~c_empty_req~0_12, ~req_t_type___0~0=v_~req_t_type___0~0_6, ~rsp_t_d~0=v_~rsp_t_d~0_8, ~s_run_i~0=v_~s_run_i~0_5, ~c_rsp_status~0=v_~c_rsp_status~0_5, ULTIMATE.start_main_~__retres1~0=v_ULTIMATE.start_main_~__retres1~0_5, ~req_t_d___0~0=v_~req_t_d___0~0_6, ~c_req_a~0=v_~c_req_a~0_5, ~c_m_lock~0=v_~c_m_lock~0_16, ~req_t_a___0~0=v_~req_t_a___0~0_6, ~req_tt_d~0=v_~req_tt_d~0_8, ~req_t_d~0=v_~req_t_d~0_8, ~rsp_t_status___0~0=v_~rsp_t_status___0~0_6, ~c_rsp_d~0=v_~c_rsp_d~0_5, ~c_req_type~0=v_~c_req_type~0_5, ~rsp_t_d___0~0=v_~rsp_t_d___0~0_6, ~rsp_t_type___0~0=v_~rsp_t_type___0~0_6, ~rsp_tt_d~0=v_~rsp_tt_d~0_8, ~req_tt_type~0=v_~req_tt_type~0_8, ~m_run_pc~0=v_~m_run_pc~0_143, ~req_t_type~0=v_~req_t_type~0_8, ~rsp_tt_type~0=v_~rsp_tt_type~0_8, ~c_req_d~0=v_~c_req_d~0_5, ~d_t~0=v_~d_t~0_14, ~s_run_st~0=v_~s_run_st~0_33, ~c_read_rsp_ev~0=v_~c_read_rsp_ev~0_27, ~c_rsp_type~0=v_~c_rsp_type~0_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ~rsp_t_status~0=v_~rsp_t_status~0_8, ~req_tt_a~0=v_~req_tt_a~0_8, ~a_t~0=v_~a_t~0_14} AuxVars[] AssignedVars[~c_empty_rsp~0, ~s_memory0~0, ~m_run_st~0, ~c_write_rsp_ev~0, ~c_m_ev~0, ~rsp_tt_status~0, ~rsp_t_type~0, ~req_t_a~0, ~s_run_pc~0, ~c_write_req_ev~0, ~m_run_i~0, ~c_read_req_ev~0, ULTIMATE.start_start_simulation_~kernel_st~0, ~c_empty_req~0, ~req_t_type___0~0, ~rsp_t_d~0, ~s_run_i~0, ~c_rsp_status~0, ULTIMATE.start_main_~__retres1~0, ~req_t_d___0~0, ~c_req_a~0, ~c_m_lock~0, ~req_t_a___0~0, ~req_tt_d~0, ~req_t_d~0, ~rsp_t_status___0~0, ~c_rsp_d~0, ~c_req_type~0, ~rsp_t_d___0~0, ~rsp_t_type___0~0, ~rsp_tt_d~0, ~req_tt_type~0, ~m_run_pc~0, ~req_t_type~0, ~rsp_tt_type~0, ~c_req_d~0, ~d_t~0, ~s_run_st~0, ~c_read_rsp_ev~0, ~c_rsp_type~0, ULTIMATE.start_main_#res, ~rsp_t_status~0, ~req_tt_a~0, ~a_t~0] 28728#L1162 [1563] L1162-->L1162-2: Formula: (and (= 1 v_~m_run_i~0_3) (= v_~m_run_st~0_2 0)) InVars {~m_run_i~0=v_~m_run_i~0_3} OutVars{~m_run_i~0=v_~m_run_i~0_3, ~m_run_st~0=v_~m_run_st~0_2} AuxVars[] AssignedVars[~m_run_st~0] 28729#L1162-2 [1799] L1162-2-->L1167-1: Formula: (and (= 1 v_~s_run_i~0_3) (= v_~s_run_st~0_3 0)) InVars {~s_run_i~0=v_~s_run_i~0_3} OutVars{~s_run_st~0=v_~s_run_st~0_3, ~s_run_i~0=v_~s_run_i~0_3} AuxVars[] AssignedVars[~s_run_st~0] 28760#L1167-1 [2105] L1167-1-->L1179: Formula: (> 1 v_~m_run_pc~0_6) InVars {~m_run_pc~0=v_~m_run_pc~0_6} OutVars{~m_run_pc~0=v_~m_run_pc~0_6} AuxVars[] AssignedVars[] 28761#L1179 [2109] L1179-->L1187: Formula: (> 2 v_~m_run_pc~0_10) InVars {~m_run_pc~0=v_~m_run_pc~0_10} OutVars{~m_run_pc~0=v_~m_run_pc~0_10} AuxVars[] AssignedVars[] 28677#L1187 [2115] L1187-->L1195: Formula: (> 3 v_~m_run_pc~0_14) InVars {~m_run_pc~0=v_~m_run_pc~0_14} OutVars{~m_run_pc~0=v_~m_run_pc~0_14} AuxVars[] AssignedVars[] 28678#L1195 [2123] L1195-->L1203: Formula: (> 4 v_~m_run_pc~0_18) InVars {~m_run_pc~0=v_~m_run_pc~0_18} OutVars{~m_run_pc~0=v_~m_run_pc~0_18} AuxVars[] AssignedVars[] 28725#L1203 [2129] L1203-->L1211: Formula: (> 5 v_~m_run_pc~0_22) InVars {~m_run_pc~0=v_~m_run_pc~0_22} OutVars{~m_run_pc~0=v_~m_run_pc~0_22} AuxVars[] AssignedVars[] 28775#L1211 [2132] L1211-->L1212: Formula: (> 6 v_~m_run_pc~0_26) InVars {~m_run_pc~0=v_~m_run_pc~0_26} OutVars{~m_run_pc~0=v_~m_run_pc~0_26} AuxVars[] AssignedVars[] 28776#L1212 [2110] L1212-->L1233: Formula: (> 2 v_~s_run_pc~0_7) InVars {~s_run_pc~0=v_~s_run_pc~0_7} OutVars{~s_run_pc~0=v_~s_run_pc~0_7} AuxVars[] AssignedVars[] 28773#L1233 [2119] L1233-->L1328-1: Formula: (< v_~s_run_pc~0_11 1) InVars {~s_run_pc~0=v_~s_run_pc~0_11} OutVars{~s_run_pc~0=v_~s_run_pc~0_11} AuxVars[] AssignedVars[] 28774#L1328-1 [2491] L1328-1-->L1135: Formula: (= v_ULTIMATE.start_start_simulation_~kernel_st~0_8 1) InVars {} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_4|, ULTIMATE.start_start_simulation_~kernel_st~0=v_ULTIMATE.start_start_simulation_~kernel_st~0_8, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_4|, ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_6, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_start_simulation_~kernel_st~0, ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0, ULTIMATE.start_eval_~tmp___0~0] 29014#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 31170#L1110 [1521] L1110-->L1114-1: Formula: (= 0 v_~m_run_st~0_16) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 30799#L1114-1 [2020-07-01 10:59:07,620 INFO L796 eck$LassoCheckResult]: Loop: 30799#L1114-1 [1872] L1114-1-->L1124: Formula: (and (= v_ULTIMATE.start_eval_~tmp~0_3 |v_ULTIMATE.start_eval_#t~nondet1_3|) (= 0 v_~m_run_st~0_18)) InVars {~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_3|} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_3, ~m_run_st~0=v_~m_run_st~0_18, ULTIMATE.start_eval_#t~nondet1=|v_ULTIMATE.start_eval_#t~nondet1_2|} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet1, ULTIMATE.start_eval_~tmp~0] 28887#L1124 [1739] L1124-->L1120: Formula: (= 0 v_ULTIMATE.start_eval_~tmp~0_5) InVars {ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} OutVars{ULTIMATE.start_eval_~tmp~0=v_ULTIMATE.start_eval_~tmp~0_5} AuxVars[] AssignedVars[] 28888#L1120 [1864] L1120-->L1139: Formula: (and (= v_ULTIMATE.start_eval_~tmp___0~0_4 |v_ULTIMATE.start_eval_#t~nondet2_3|) (= 0 v_~s_run_st~0_31)) InVars {~s_run_st~0=v_~s_run_st~0_31, ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_3|} OutVars{ULTIMATE.start_eval_#t~nondet2=|v_ULTIMATE.start_eval_#t~nondet2_2|, ~s_run_st~0=v_~s_run_st~0_31, ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_eval_#t~nondet2, ULTIMATE.start_eval_~tmp___0~0] 30814#L1139 [1627] L1139-->L1135: Formula: (= 0 v_ULTIMATE.start_eval_~tmp___0~0_3) InVars {ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_3} OutVars{ULTIMATE.start_eval_~tmp___0~0=v_ULTIMATE.start_eval_~tmp___0~0_3} AuxVars[] AssignedVars[] 30812#L1135 [1769] L1135-->L1110: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 30800#L1110 [1521] L1110-->L1114-1: Formula: (= 0 v_~m_run_st~0_16) InVars {~m_run_st~0=v_~m_run_st~0_16} OutVars{~m_run_st~0=v_~m_run_st~0_16} AuxVars[] AssignedVars[] 30799#L1114-1 [2020-07-01 10:59:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1620604262, now seen corresponding path program 4 times [2020-07-01 10:59:07,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:07,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972133253] [2020-07-01 10:59:07,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:07,634 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:59:07,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:07,634 INFO L82 PathProgramCache]: Analyzing trace with hash 309852855, now seen corresponding path program 1 times [2020-07-01 10:59:07,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:07,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827491770] [2020-07-01 10:59:07,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:07,641 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:59:07,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 10:59:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1191571364, now seen corresponding path program 1 times [2020-07-01 10:59:07,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 10:59:07,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495978739] [2020-07-01 10:59:07,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 10:59:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 10:59:07,657 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 10:59:07,966 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2020-07-01 10:59:08,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 10:59:08 BasicIcfg [2020-07-01 10:59:08,097 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 10:59:08,098 INFO L168 Benchmark]: Toolchain (without parser) took 15785.25 ms. Allocated memory was 649.6 MB in the beginning and 1.1 GB in the end (delta: 414.7 MB). Free memory was 560.2 MB in the beginning and 857.1 MB in the end (delta: -296.8 MB). Peak memory consumption was 537.0 MB. Max. memory is 50.3 GB. [2020-07-01 10:59:08,099 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.1 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 10:59:08,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.14 ms. Allocated memory was 649.6 MB in the beginning and 693.6 MB in the end (delta: 44.0 MB). Free memory was 560.2 MB in the beginning and 641.0 MB in the end (delta: -80.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 50.3 GB. [2020-07-01 10:59:08,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.01 ms. Allocated memory is still 693.6 MB. Free memory was 641.0 MB in the beginning and 636.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. [2020-07-01 10:59:08,100 INFO L168 Benchmark]: Boogie Preprocessor took 48.71 ms. Allocated memory is still 693.6 MB. Free memory was 636.7 MB in the beginning and 631.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-07-01 10:59:08,101 INFO L168 Benchmark]: RCFGBuilder took 959.96 ms. Allocated memory is still 693.6 MB. Free memory was 631.3 MB in the beginning and 537.0 MB in the end (delta: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 50.3 GB. [2020-07-01 10:59:08,101 INFO L168 Benchmark]: BlockEncodingV2 took 287.24 ms. Allocated memory is still 693.6 MB. Free memory was 537.0 MB in the beginning and 488.4 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 50.3 GB. [2020-07-01 10:59:08,101 INFO L168 Benchmark]: TraceAbstraction took 369.41 ms. Allocated memory is still 693.6 MB. Free memory was 487.3 MB in the beginning and 439.6 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 50.3 GB. [2020-07-01 10:59:08,102 INFO L168 Benchmark]: BuchiAutomizer took 13533.88 ms. Allocated memory was 693.6 MB in the beginning and 1.1 GB in the end (delta: 370.7 MB). Free memory was 439.6 MB in the beginning and 857.1 MB in the end (delta: -417.4 MB). Peak memory consumption was 372.4 MB. Max. memory is 50.3 GB. [2020-07-01 10:59:08,105 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 265 locations, 487 edges - StatisticsResult: Encoded RCFG 228 locations, 610 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.1 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 510.14 ms. Allocated memory was 649.6 MB in the beginning and 693.6 MB in the end (delta: 44.0 MB). Free memory was 560.2 MB in the beginning and 641.0 MB in the end (delta: -80.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 70.01 ms. Allocated memory is still 693.6 MB. Free memory was 641.0 MB in the beginning and 636.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 48.71 ms. Allocated memory is still 693.6 MB. Free memory was 636.7 MB in the beginning and 631.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * RCFGBuilder took 959.96 ms. Allocated memory is still 693.6 MB. Free memory was 631.3 MB in the beginning and 537.0 MB in the end (delta: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 287.24 ms. Allocated memory is still 693.6 MB. Free memory was 537.0 MB in the beginning and 488.4 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 369.41 ms. Allocated memory is still 693.6 MB. Free memory was 487.3 MB in the beginning and 439.6 MB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 13533.88 ms. Allocated memory was 693.6 MB in the beginning and 1.1 GB in the end (delta: 370.7 MB). Free memory was 439.6 MB in the beginning and 857.1 MB in the end (delta: -417.4 MB). Peak memory consumption was 372.4 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 925]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1031]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 570]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1188]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1103]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 428]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 800]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1269]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 746]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1277]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 955]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 933]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1039]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 608]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1226]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1204]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1307]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1285]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 762]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 981]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 718]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 696]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 909]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 770]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 868]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1077]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1172]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1055]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 518]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1180]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1253]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 854]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 737]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 664]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1261]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 672]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 800]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 917]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 778]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 975]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 228 locations, 0 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred 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: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 95 LocationsWithAnnotation, 95 PreInvPairs, 95 NumberOfFragments, 95 HoareAnnotationTreeSize, 95 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 95 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (7 trivial, 0 deterministic, 2 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function m_run_st and consists of 9 locations. One nondeterministic module has affine ranking function m_run_st and consists of 9 locations. 7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2662 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.4s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 6.9s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 9. Automata minimization 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1295 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 2695 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2831 SDtfs, 6531 SDslu, 7560 SDs, 0 SdLazy, 10702 SolverSat, 546 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN1 SILU0 SILI1 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf91 smp100 dnf100 smp100 tf118 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 1120]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {req_tt_d=0, rsp_t_d___0=0, a_t=0, c_rsp_d=0, c_m_lock=0, \result=0, m_run_st=0, req_tt_a=0, c_write_req_ev=2, s_run_i=1, s_run_st=0, rsp_t_status=0, tmp=0, kernel_st=1, rsp_tt_status=0, c_empty_req=1, req_t_type___0=0, tmp___0=0, c_read_rsp_ev=2, m_run_i=1, rsp_t_status___0=0, c_m_ev=2, c_empty_rsp=1, req_t_d___0=0, req_t_d=0, c_req_d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22afbe1a=0, c_read_req_ev=2, req_t_a=0, c_req_a=0, rsp_t_type=0, req_t_a___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d9c9310=0, c_req_type=0, s_memory0=0, req_t_type=0, d_t=0, req_tt_type=0, rsp_t_d=0, c_write_rsp_ev=2, rsp_t_type___0=0, c_rsp_status=0, m_run_pc=0, s_run_pc=0, rsp_tt_type=0, rsp_tt_d=0, c_rsp_type=0, __retres1=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 1109]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int m_run_st ; [L16] int m_run_i ; [L17] int m_run_pc ; [L18] int s_memory0 ; [L20] int s_run_st ; [L21] int s_run_i ; [L22] int s_run_pc ; [L23] int c_m_lock ; [L24] int c_m_ev ; [L25] int c_req_type ; [L26] int c_req_a ; [L27] int c_req_d ; [L28] int c_rsp_type ; [L29] int c_rsp_status ; [L30] int c_rsp_d ; [L31] int c_empty_req ; [L32] int c_empty_rsp ; [L33] int c_read_req_ev ; [L34] int c_write_req_ev ; [L35] int c_read_rsp_ev ; [L36] int c_write_rsp_ev ; [L37] static int d_t ; [L38] static int a_t ; [L39] static int req_t_type ; [L40] static int req_t_a ; [L41] static int req_t_d ; [L42] static int rsp_t_type ; [L43] static int rsp_t_status ; [L44] static int rsp_t_d ; [L45] static int req_tt_type ; [L46] static int req_tt_a ; [L47] static int req_tt_d ; [L48] static int rsp_tt_type ; [L49] static int rsp_tt_status ; [L50] static int rsp_tt_d ; [L835] static int req_t_type___0 ; [L836] static int req_t_a___0 ; [L837] static int req_t_d___0 ; [L838] static int rsp_t_type___0 ; [L839] static int rsp_t_status___0 ; [L840] static int rsp_t_d___0 ; [L1342] int __retres1 ; [L1346] c_m_lock = 0 [L1347] c_m_ev = 2 [L1349] m_run_i = 1 [L1350] m_run_pc = 0 [L1351] s_run_i = 1 [L1352] s_run_pc = 0 [L1353] c_empty_req = 1 [L1354] c_empty_rsp = 1 [L1355] c_read_req_ev = 2 [L1356] c_write_req_ev = 2 [L1357] c_read_rsp_ev = 2 [L1358] c_write_rsp_ev = 2 [L1359] c_m_lock = 0 [L1360] c_m_ev = 2 [L1158] int kernel_st ; [L1161] kernel_st = 0 [L1162] COND TRUE (int )m_run_i == 1 [L1163] m_run_st = 0 [L1167] COND TRUE (int )s_run_i == 1 [L1168] s_run_st = 0 [L1172] COND FALSE !((int )m_run_pc == 1) [L1180] COND FALSE !((int )m_run_pc == 2) [L1188] COND FALSE !((int )m_run_pc == 3) [L1196] COND FALSE !((int )m_run_pc == 4) [L1204] COND FALSE !((int )m_run_pc == 5) [L1212] COND FALSE !((int )m_run_pc == 6) [L1226] COND FALSE !((int )s_run_pc == 2) [L1234] COND FALSE !((int )s_run_pc == 1) [L1245] COND TRUE 1 [L1248] kernel_st = 1 [L1104] int tmp ; [L1105] int tmp___0 ; [L1109] COND TRUE 1 [L1111] COND TRUE (int )m_run_st == 0 Loop: [L1120] COND TRUE (int )m_run_st == 0 [L1122] tmp = __VERIFIER_nondet_int() [L1124] COND FALSE !(\read(tmp)) [L1135] COND TRUE (int )s_run_st == 0 [L1137] tmp___0 = __VERIFIER_nondet_int() [L1139] COND FALSE !(\read(tmp___0)) [L1109] COND TRUE 1 [L1111] COND TRUE (int )m_run_st == 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-07-01 10:58:49.056 ----------------------------------------------- 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/sandbox/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/sandbox/tmp/BenchExec_run_8rv4xC/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 10:59:08.356 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check