./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa63abe8d244d72d8b78f82e911235dbe511cfc8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:17:28,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:17:28,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:17:28,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:17:28,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:17:28,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:17:28,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:17:28,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:17:28,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:17:28,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:17:28,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:17:28,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:17:28,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:17:28,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:17:28,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:17:28,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:17:28,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:17:28,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:17:28,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:17:28,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:17:28,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:17:28,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:17:28,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:17:28,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:17:28,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:17:28,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:17:28,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:17:28,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:17:28,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:17:28,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:17:28,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:17:28,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:17:28,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:17:28,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:17:28,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:17:28,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:17:28,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:17:28,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:17:28,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:17:28,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:17:28,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:17:28,302 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:17:28,329 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:17:28,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:17:28,331 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:17:28,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:17:28,332 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:17:28,332 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:17:28,332 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:17:28,333 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:17:28,333 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:17:28,333 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:17:28,334 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:17:28,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:17:28,335 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:17:28,335 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:17:28,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:17:28,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:17:28,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:17:28,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:17:28,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:17:28,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:17:28,337 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:17:28,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:17:28,337 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:17:28,337 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:17:28,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:17:28,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:17:28,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:17:28,338 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:17:28,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:17:28,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:17:28,339 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:17:28,340 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:17:28,341 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:17:28,342 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2019-11-28 21:17:28,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:17:28,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:17:28,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:17:28,665 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:17:28,666 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:17:28,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-28 21:17:28,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf73ca354/9b69315482bc4abdbc31388eb3c14539/FLAG11f1b3fc9 [2019-11-28 21:17:29,251 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:17:29,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-28 21:17:29,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf73ca354/9b69315482bc4abdbc31388eb3c14539/FLAG11f1b3fc9 [2019-11-28 21:17:29,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf73ca354/9b69315482bc4abdbc31388eb3c14539 [2019-11-28 21:17:29,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:17:29,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:17:29,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:17:29,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:17:29,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:17:29,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:17:29" (1/1) ... [2019-11-28 21:17:29,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c492e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29, skipping insertion in model container [2019-11-28 21:17:29,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:17:29" (1/1) ... [2019-11-28 21:17:29,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:17:29,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:17:29,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:17:29,838 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:17:29,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:17:29,950 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:17:29,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29 WrapperNode [2019-11-28 21:17:29,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:17:29,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:17:29,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:17:29,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:17:29,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29" (1/1) ... [2019-11-28 21:17:29,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29" (1/1) ... [2019-11-28 21:17:29,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:17:29,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:17:29,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:17:29,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:17:30,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29" (1/1) ... [2019-11-28 21:17:30,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29" (1/1) ... [2019-11-28 21:17:30,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29" (1/1) ... [2019-11-28 21:17:30,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29" (1/1) ... [2019-11-28 21:17:30,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29" (1/1) ... [2019-11-28 21:17:30,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29" (1/1) ... [2019-11-28 21:17:30,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29" (1/1) ... [2019-11-28 21:17:30,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:17:30,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:17:30,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:17:30,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:17:30,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 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 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:17:30,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:17:30,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:17:30,543 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:17:30,544 INFO L287 CfgBuilder]: Removed 42 assume(true) statements. [2019-11-28 21:17:30,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:17:30 BoogieIcfgContainer [2019-11-28 21:17:30,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:17:30,546 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:17:30,546 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:17:30,550 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:17:30,551 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:17:30,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:17:29" (1/3) ... [2019-11-28 21:17:30,553 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5736e80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:17:30, skipping insertion in model container [2019-11-28 21:17:30,553 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:17:30,553 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:17:29" (2/3) ... [2019-11-28 21:17:30,554 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5736e80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:17:30, skipping insertion in model container [2019-11-28 21:17:30,554 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:17:30,554 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:17:30" (3/3) ... [2019-11-28 21:17:30,556 INFO L371 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-11-28 21:17:30,606 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:17:30,606 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:17:30,606 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:17:30,607 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:17:30,607 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:17:30,607 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:17:30,607 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:17:30,607 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:17:30,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2019-11-28 21:17:30,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-11-28 21:17:30,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:17:30,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:17:30,658 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:17:30,659 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:17:30,659 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:17:30,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2019-11-28 21:17:30,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-11-28 21:17:30,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:17:30,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:17:30,666 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:17:30,666 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:17:30,673 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 8#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 74#L346true havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 76#L196true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 73#L196-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 60#L313-1true [2019-11-28 21:17:30,673 INFO L796 eck$LassoCheckResult]: Loop: 60#L313-1true assume !false; 22#L314true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 63#L262true assume false; 37#L278true havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 68#L214-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 14#L226-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 42#L227-1true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 23#L292true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12#L299true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L300true start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 65#L320true assume !(0 != start_simulation_~tmp~3); 60#L313-1true [2019-11-28 21:17:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2019-11-28 21:17:30,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:30,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365227979] [2019-11-28 21:17:30,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:17:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:17:30,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365227979] [2019-11-28 21:17:30,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:17:30,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:17:30,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96844236] [2019-11-28 21:17:30,843 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:17:30,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:30,844 INFO L82 PathProgramCache]: Analyzing trace with hash -168076210, now seen corresponding path program 1 times [2019-11-28 21:17:30,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:30,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252762523] [2019-11-28 21:17:30,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:17:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:17:30,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252762523] [2019-11-28 21:17:30,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:17:30,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 21:17:30,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678806581] [2019-11-28 21:17:30,857 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:17:30,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:17:30,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:17:30,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:17:30,877 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2019-11-28 21:17:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:17:30,903 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2019-11-28 21:17:30,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:17:30,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2019-11-28 21:17:30,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-28 21:17:30,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 97 transitions. [2019-11-28 21:17:30,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-28 21:17:30,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-28 21:17:30,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 97 transitions. [2019-11-28 21:17:30,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:17:30,919 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2019-11-28 21:17:30,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 97 transitions. [2019-11-28 21:17:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 21:17:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 21:17:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2019-11-28 21:17:30,956 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2019-11-28 21:17:30,956 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2019-11-28 21:17:30,956 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:17:30,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 97 transitions. [2019-11-28 21:17:30,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-28 21:17:30,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:17:30,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:17:30,959 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:17:30,959 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:17:30,960 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 167#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 168#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 224#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 223#L196-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 220#L313-1 [2019-11-28 21:17:30,960 INFO L796 eck$LassoCheckResult]: Loop: 220#L313-1 assume !false; 189#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 172#L262 assume !false; 211#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 212#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 183#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 184#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 197#L242 assume !(0 != eval_~tmp___1~0); 198#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 204#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 181#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 182#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 190#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 177#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 178#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 208#L320 assume !(0 != start_simulation_~tmp~3); 220#L313-1 [2019-11-28 21:17:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:30,960 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2019-11-28 21:17:30,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:30,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600605474] [2019-11-28 21:17:30,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:17:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:17:30,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600605474] [2019-11-28 21:17:30,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:17:30,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 21:17:30,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496429796] [2019-11-28 21:17:30,992 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:17:30,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:30,993 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 1 times [2019-11-28 21:17:30,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:30,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049210742] [2019-11-28 21:17:30,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:17:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:17:31,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049210742] [2019-11-28 21:17:31,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:17:31,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:17:31,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047815160] [2019-11-28 21:17:31,046 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:17:31,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:17:31,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:17:31,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:17:31,047 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. cyclomatic complexity: 30 Second operand 3 states. [2019-11-28 21:17:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:17:31,059 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2019-11-28 21:17:31,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:17:31,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 96 transitions. [2019-11-28 21:17:31,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-28 21:17:31,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 96 transitions. [2019-11-28 21:17:31,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-28 21:17:31,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-28 21:17:31,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2019-11-28 21:17:31,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:17:31,068 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-28 21:17:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2019-11-28 21:17:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 21:17:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 21:17:31,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2019-11-28 21:17:31,081 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-28 21:17:31,082 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-28 21:17:31,082 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:17:31,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2019-11-28 21:17:31,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-28 21:17:31,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:17:31,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:17:31,087 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:17:31,089 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:17:31,089 INFO L794 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 312#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 313#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 369#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 368#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 365#L313-1 [2019-11-28 21:17:31,091 INFO L796 eck$LassoCheckResult]: Loop: 365#L313-1 assume !false; 334#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 317#L262 assume !false; 356#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 357#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 328#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 329#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 342#L242 assume !(0 != eval_~tmp___1~0); 343#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 349#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 326#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 327#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 335#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 322#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 323#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 350#L320 assume !(0 != start_simulation_~tmp~3); 365#L313-1 [2019-11-28 21:17:31,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2019-11-28 21:17:31,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:31,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624563737] [2019-11-28 21:17:31,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,172 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:17:31,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:31,173 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 2 times [2019-11-28 21:17:31,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:31,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134142561] [2019-11-28 21:17:31,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:17:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:17:31,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134142561] [2019-11-28 21:17:31,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:17:31,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:17:31,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719273970] [2019-11-28 21:17:31,225 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:17:31,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:17:31,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 21:17:31,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 21:17:31,228 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 5 states. [2019-11-28 21:17:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:17:31,344 INFO L93 Difference]: Finished difference Result 134 states and 187 transitions. [2019-11-28 21:17:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 21:17:31,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 187 transitions. [2019-11-28 21:17:31,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2019-11-28 21:17:31,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 187 transitions. [2019-11-28 21:17:31,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-11-28 21:17:31,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-11-28 21:17:31,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 187 transitions. [2019-11-28 21:17:31,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:17:31,354 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-11-28 21:17:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 187 transitions. [2019-11-28 21:17:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2019-11-28 21:17:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 21:17:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2019-11-28 21:17:31,361 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-11-28 21:17:31,362 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-11-28 21:17:31,362 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:17:31,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2019-11-28 21:17:31,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-11-28 21:17:31,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:17:31,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:17:31,366 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:17:31,366 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:17:31,366 INFO L794 eck$LassoCheckResult]: Stem: 563#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 530#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 531#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 589#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 588#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 585#L313-1 [2019-11-28 21:17:31,367 INFO L796 eck$LassoCheckResult]: Loop: 585#L313-1 assume !false; 552#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 533#L262 assume !false; 575#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 576#L214 assume !(0 == ~p_dw_st~0); 583#L218 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 546#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 547#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 590#L242 assume !(0 != eval_~tmp___1~0); 566#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 567#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 544#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 545#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 553#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 540#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 541#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 570#L320 assume !(0 != start_simulation_~tmp~3); 585#L313-1 [2019-11-28 21:17:31,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:31,367 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2019-11-28 21:17:31,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:31,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584139018] [2019-11-28 21:17:31,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,388 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:17:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:31,389 INFO L82 PathProgramCache]: Analyzing trace with hash 616414076, now seen corresponding path program 1 times [2019-11-28 21:17:31,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:31,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546847708] [2019-11-28 21:17:31,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:17:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:17:31,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546847708] [2019-11-28 21:17:31,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:17:31,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:17:31,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032413742] [2019-11-28 21:17:31,419 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:17:31,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:17:31,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:17:31,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:17:31,420 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand 3 states. [2019-11-28 21:17:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:17:31,463 INFO L93 Difference]: Finished difference Result 121 states and 166 transitions. [2019-11-28 21:17:31,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:17:31,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 166 transitions. [2019-11-28 21:17:31,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2019-11-28 21:17:31,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 166 transitions. [2019-11-28 21:17:31,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-11-28 21:17:31,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-11-28 21:17:31,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 166 transitions. [2019-11-28 21:17:31,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:17:31,469 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 166 transitions. [2019-11-28 21:17:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 166 transitions. [2019-11-28 21:17:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2019-11-28 21:17:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 21:17:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2019-11-28 21:17:31,477 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2019-11-28 21:17:31,478 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2019-11-28 21:17:31,478 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:17:31,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 142 transitions. [2019-11-28 21:17:31,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2019-11-28 21:17:31,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:17:31,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:17:31,480 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:17:31,480 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:17:31,480 INFO L794 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 728#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 729#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 793#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 791#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 792#L313-1 assume !false; 805#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 802#L262 [2019-11-28 21:17:31,481 INFO L796 eck$LassoCheckResult]: Loop: 802#L262 assume !false; 801#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 800#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 799#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 798#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 797#L242 assume 0 != eval_~tmp___1~0; 796#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 786#L251 assume !(0 != eval_~tmp~1); 787#L247 assume !(0 == ~c_dr_st~0); 802#L262 [2019-11-28 21:17:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:31,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2019-11-28 21:17:31,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:31,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340106449] [2019-11-28 21:17:31,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,501 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:17:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:31,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1028489344, now seen corresponding path program 1 times [2019-11-28 21:17:31,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:31,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193803426] [2019-11-28 21:17:31,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,518 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:17:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1783037256, now seen corresponding path program 1 times [2019-11-28 21:17:31,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:31,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448484740] [2019-11-28 21:17:31,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:17:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:17:31,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448484740] [2019-11-28 21:17:31,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:17:31,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 21:17:31,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102044286] [2019-11-28 21:17:31,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:17:31,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:17:31,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:17:31,653 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. cyclomatic complexity: 39 Second operand 3 states. [2019-11-28 21:17:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:17:31,700 INFO L93 Difference]: Finished difference Result 184 states and 249 transitions. [2019-11-28 21:17:31,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:17:31,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 249 transitions. [2019-11-28 21:17:31,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2019-11-28 21:17:31,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 184 states and 249 transitions. [2019-11-28 21:17:31,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2019-11-28 21:17:31,708 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2019-11-28 21:17:31,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 249 transitions. [2019-11-28 21:17:31,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:17:31,714 INFO L688 BuchiCegarLoop]: Abstraction has 184 states and 249 transitions. [2019-11-28 21:17:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 249 transitions. [2019-11-28 21:17:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 146. [2019-11-28 21:17:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-28 21:17:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 197 transitions. [2019-11-28 21:17:31,736 INFO L711 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2019-11-28 21:17:31,736 INFO L591 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2019-11-28 21:17:31,736 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 21:17:31,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 197 transitions. [2019-11-28 21:17:31,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2019-11-28 21:17:31,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:17:31,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:17:31,741 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:17:31,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:17:31,741 INFO L794 eck$LassoCheckResult]: Stem: 1058#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1024#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1025#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1096#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1095#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1087#L313-1 assume !false; 1047#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1027#L262 [2019-11-28 21:17:31,742 INFO L796 eck$LassoCheckResult]: Loop: 1027#L262 assume !false; 1141#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1139#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1138#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1137#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1136#L242 assume 0 != eval_~tmp___1~0; 1135#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1088#L251 assume !(0 != eval_~tmp~1); 1089#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 1026#L266 assume !(0 != eval_~tmp___0~1); 1027#L262 [2019-11-28 21:17:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:31,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2019-11-28 21:17:31,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:31,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138325884] [2019-11-28 21:17:31,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,779 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:17:31,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:31,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1818395562, now seen corresponding path program 1 times [2019-11-28 21:17:31,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:31,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994622090] [2019-11-28 21:17:31,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:17:31,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:17:31,809 INFO L82 PathProgramCache]: Analyzing trace with hash 560416882, now seen corresponding path program 1 times [2019-11-28 21:17:31,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:17:31,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161227592] [2019-11-28 21:17:31,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:17:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:17:31,842 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:17:32,036 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-28 21:17:32,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:17:32 BoogieIcfgContainer [2019-11-28 21:17:32,136 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:17:32,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:17:32,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:17:32,138 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:17:32,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:17:30" (3/4) ... [2019-11-28 21:17:32,143 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 21:17:32,244 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 21:17:32,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:17:32,248 INFO L168 Benchmark]: Toolchain (without parser) took 2638.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 957.7 MB in the beginning and 974.7 MB in the end (delta: -17.0 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:17:32,249 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:17:32,250 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 21:17:32,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:17:32,253 INFO L168 Benchmark]: Boogie Preprocessor took 30.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:17:32,253 INFO L168 Benchmark]: RCFGBuilder took 516.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2019-11-28 21:17:32,254 INFO L168 Benchmark]: BuchiAutomizer took 1589.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.3 MB in the end (delta: 112.6 MB). Peak memory consumption was 112.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:17:32,258 INFO L168 Benchmark]: Witness Printer took 107.37 ms. Allocated memory is still 1.2 GB. Free memory was 981.3 MB in the beginning and 974.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 21:17:32,260 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 516.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1589.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.3 MB in the end (delta: 112.6 MB). Peak memory consumption was 112.6 MB. Max. memory is 11.5 GB. * Witness Printer took 107.37 ms. Allocated memory is still 1.2 GB. Free memory was 981.3 MB in the beginning and 974.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 146 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 118 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 146 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 537 SDtfs, 571 SDslu, 420 SDs, 0 SdLazy, 55 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 237]: 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 {p_last_write=0, c_dr_i=1, c_dr_pc=0, a_t=0, \result=0, c_num_read=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b4aaaec=0, c_dr_st=0, kernel_st=1, q_read_ev=2, p_dw_i=1, tmp___0=0, tmp___1=1, q_write_ev=2, __retres1=1, p_dw_pc=0, tmp=0, q_free=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2be01295=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4edbdf02=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12f1ef95=0, p_dw_st=0, c_last_read=0, p_num_write=0, q_buf_0=0, __retres1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 237]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L14] int q_buf_0 ; [L15] int q_free ; [L16] int q_read_ev ; [L17] int q_write_ev ; [L18] int p_num_write ; [L19] int p_last_write ; [L20] int p_dw_st ; [L21] int p_dw_pc ; [L22] int p_dw_i ; [L23] int c_num_read ; [L24] int c_last_read ; [L25] int c_dr_st ; [L26] int c_dr_pc ; [L27] int c_dr_i ; [L134] static int a_t ; [L350] int __retres1 ; [L336] q_free = 1 [L337] q_write_ev = 2 [L338] q_read_ev = q_write_ev [L339] p_num_write = 0 [L340] p_dw_pc = 0 [L341] p_dw_i = 1 [L342] c_num_read = 0 [L343] c_dr_pc = 0 [L344] c_dr_i = 1 [L304] int kernel_st ; [L305] int tmp ; [L309] kernel_st = 0 [L196] COND TRUE (int )p_dw_i == 1 [L197] p_dw_st = 0 [L201] COND TRUE (int )c_dr_i == 1 [L202] c_dr_st = 0 [L313] COND TRUE 1 [L316] kernel_st = 1 [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; Loop: [L237] COND TRUE 1 [L211] int __retres1 ; [L214] COND TRUE (int )p_dw_st == 0 [L215] __retres1 = 1 [L227] return (__retres1); [L240] tmp___1 = exists_runnable_thread() [L242] COND TRUE \read(tmp___1) [L247] COND TRUE (int )p_dw_st == 0 [L249] tmp = __VERIFIER_nondet_int() [L251] COND FALSE !(\read(tmp)) [L262] COND TRUE (int )c_dr_st == 0 [L264] tmp___0 = __VERIFIER_nondet_int() [L266] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...