./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer --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.24-cad4683 [2019-11-15 20:51:13,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:51:13,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:51:13,135 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:51:13,136 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:51:13,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:51:13,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:51:13,143 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:51:13,145 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:51:13,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:51:13,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:51:13,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:51:13,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:51:13,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:51:13,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:51:13,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:51:13,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:51:13,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:51:13,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:51:13,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:51:13,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:51:13,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:51:13,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:51:13,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:51:13,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:51:13,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:51:13,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:51:13,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:51:13,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:51:13,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:51:13,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:51:13,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:51:13,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:51:13,180 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:51:13,181 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:51:13,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:51:13,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:51:13,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:51:13,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:51:13,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:51:13,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:51:13,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:51:13,226 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:51:13,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:51:13,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:51:13,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:51:13,229 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:51:13,229 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:51:13,229 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:51:13,230 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:51:13,230 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:51:13,230 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:51:13,231 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:51:13,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:51:13,232 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:51:13,233 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:51:13,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:51:13,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:51:13,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:51:13,234 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:51:13,234 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:51:13,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:51:13,235 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:51:13,235 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:51:13,235 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:51:13,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:51:13,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:51:13,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:51:13,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:51:13,237 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:51:13,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:51:13,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:51:13,237 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:51:13,241 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:51:13,241 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer 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-15 20:51:13,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:51:13,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:51:13,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:51:13,313 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:51:13,313 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:51:13,314 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-15 20:51:13,388 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/data/b99af1984/35d36f68451646c1be3a63ea7eadfede/FLAGaa5c91c51 [2019-11-15 20:51:13,830 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:51:13,832 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-15 20:51:13,846 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/data/b99af1984/35d36f68451646c1be3a63ea7eadfede/FLAGaa5c91c51 [2019-11-15 20:51:14,150 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/data/b99af1984/35d36f68451646c1be3a63ea7eadfede [2019-11-15 20:51:14,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:51:14,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:51:14,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:51:14,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:51:14,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:51:14,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72956611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14, skipping insertion in model container [2019-11-15 20:51:14,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,170 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:51:14,197 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:51:14,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:51:14,459 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:51:14,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:51:14,526 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:51:14,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14 WrapperNode [2019-11-15 20:51:14,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:51:14,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:51:14,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:51:14,528 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:51:14,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:51:14,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:51:14,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:51:14,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:51:14,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... [2019-11-15 20:51:14,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:51:14,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:51:14,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:51:14,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:51:14,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/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-15 20:51:14,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:51:14,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:51:15,158 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:51:15,158 INFO L284 CfgBuilder]: Removed 42 assume(true) statements. [2019-11-15 20:51:15,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:51:15 BoogieIcfgContainer [2019-11-15 20:51:15,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:51:15,160 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:51:15,160 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:51:15,163 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:51:15,164 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:51:15,164 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:51:14" (1/3) ... [2019-11-15 20:51:15,165 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@779fe1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:51:15, skipping insertion in model container [2019-11-15 20:51:15,165 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:51:15,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:51:14" (2/3) ... [2019-11-15 20:51:15,166 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@779fe1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:51:15, skipping insertion in model container [2019-11-15 20:51:15,166 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:51:15,166 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:51:15" (3/3) ... [2019-11-15 20:51:15,168 INFO L371 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-11-15 20:51:15,207 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:51:15,207 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:51:15,207 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:51:15,207 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:51:15,208 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:51:15,208 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:51:15,208 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:51:15,208 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:51:15,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2019-11-15 20:51:15,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-11-15 20:51:15,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:51:15,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:51:15,264 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:51:15,264 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:15,265 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:51:15,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2019-11-15 20:51:15,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-11-15 20:51:15,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:51:15,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:51:15,272 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:51:15,272 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:15,279 INFO L791 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-15 20:51:15,280 INFO L793 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-15 20:51:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:15,286 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2019-11-15 20:51:15,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:15,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803358608] [2019-11-15 20:51:15,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:15,429 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-15 20:51:15,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803358608] [2019-11-15 20:51:15,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:15,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:51:15,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567502025] [2019-11-15 20:51:15,436 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:51:15,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:15,436 INFO L82 PathProgramCache]: Analyzing trace with hash -168076210, now seen corresponding path program 1 times [2019-11-15 20:51:15,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:15,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261574172] [2019-11-15 20:51:15,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:15,446 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-15 20:51:15,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261574172] [2019-11-15 20:51:15,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:15,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:51:15,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083035885] [2019-11-15 20:51:15,449 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:51:15,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:15,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:51:15,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:51:15,470 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2019-11-15 20:51:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:15,496 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2019-11-15 20:51:15,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:51:15,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2019-11-15 20:51:15,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-15 20:51:15,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 97 transitions. [2019-11-15 20:51:15,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-15 20:51:15,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 20:51:15,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 97 transitions. [2019-11-15 20:51:15,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:51:15,513 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2019-11-15 20:51:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 97 transitions. [2019-11-15 20:51:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 20:51:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 20:51:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2019-11-15 20:51:15,550 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2019-11-15 20:51:15,550 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2019-11-15 20:51:15,550 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:51:15,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 97 transitions. [2019-11-15 20:51:15,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-15 20:51:15,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:51:15,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:51:15,556 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:51:15,556 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:15,557 INFO L791 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-15 20:51:15,557 INFO L793 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-15 20:51:15,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:15,558 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2019-11-15 20:51:15,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:15,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754562844] [2019-11-15 20:51:15,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:15,621 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-15 20:51:15,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754562844] [2019-11-15 20:51:15,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:15,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:51:15,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179053024] [2019-11-15 20:51:15,623 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:51:15,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 1 times [2019-11-15 20:51:15,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:15,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911116898] [2019-11-15 20:51:15,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:15,706 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-15 20:51:15,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911116898] [2019-11-15 20:51:15,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:15,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:51:15,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724560948] [2019-11-15 20:51:15,708 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:51:15,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:15,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:51:15,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:51:15,709 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. cyclomatic complexity: 30 Second operand 3 states. [2019-11-15 20:51:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:15,720 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2019-11-15 20:51:15,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:51:15,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 96 transitions. [2019-11-15 20:51:15,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-15 20:51:15,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 96 transitions. [2019-11-15 20:51:15,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-15 20:51:15,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-15 20:51:15,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2019-11-15 20:51:15,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:51:15,727 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-15 20:51:15,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2019-11-15 20:51:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 20:51:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 20:51:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2019-11-15 20:51:15,734 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-15 20:51:15,734 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-15 20:51:15,734 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:51:15,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2019-11-15 20:51:15,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-15 20:51:15,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:51:15,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:51:15,737 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:51:15,737 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:15,737 INFO L791 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-15 20:51:15,738 INFO L793 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-15 20:51:15,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2019-11-15 20:51:15,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:15,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594559139] [2019-11-15 20:51:15,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:15,783 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:51:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 2 times [2019-11-15 20:51:15,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:15,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292991418] [2019-11-15 20:51:15,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:15,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:15,860 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-15 20:51:15,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292991418] [2019-11-15 20:51:15,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:15,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:51:15,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001627524] [2019-11-15 20:51:15,862 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:51:15,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:15,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:51:15,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:51:15,863 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 5 states. [2019-11-15 20:51:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:15,997 INFO L93 Difference]: Finished difference Result 134 states and 187 transitions. [2019-11-15 20:51:16,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:51:16,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 187 transitions. [2019-11-15 20:51:16,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2019-11-15 20:51:16,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 187 transitions. [2019-11-15 20:51:16,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-11-15 20:51:16,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-11-15 20:51:16,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 187 transitions. [2019-11-15 20:51:16,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:51:16,009 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-11-15 20:51:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 187 transitions. [2019-11-15 20:51:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2019-11-15 20:51:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 20:51:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2019-11-15 20:51:16,024 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-11-15 20:51:16,024 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-11-15 20:51:16,024 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:51:16,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2019-11-15 20:51:16,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-11-15 20:51:16,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:51:16,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:51:16,029 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:51:16,029 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-15 20:51:16,030 INFO L791 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-15 20:51:16,030 INFO L793 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-15 20:51:16,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:16,030 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2019-11-15 20:51:16,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:16,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883157174] [2019-11-15 20:51:16,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,058 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:51:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash 616414076, now seen corresponding path program 1 times [2019-11-15 20:51:16,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:16,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679463102] [2019-11-15 20:51:16,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:16,096 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-15 20:51:16,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679463102] [2019-11-15 20:51:16,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:16,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:51:16,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610802972] [2019-11-15 20:51:16,098 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:51:16,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:16,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:51:16,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:51:16,098 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand 3 states. [2019-11-15 20:51:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:16,147 INFO L93 Difference]: Finished difference Result 121 states and 166 transitions. [2019-11-15 20:51:16,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:51:16,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 166 transitions. [2019-11-15 20:51:16,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2019-11-15 20:51:16,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 166 transitions. [2019-11-15 20:51:16,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-11-15 20:51:16,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-11-15 20:51:16,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 166 transitions. [2019-11-15 20:51:16,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:51:16,153 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 166 transitions. [2019-11-15 20:51:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 166 transitions. [2019-11-15 20:51:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2019-11-15 20:51:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 20:51:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2019-11-15 20:51:16,172 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2019-11-15 20:51:16,173 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2019-11-15 20:51:16,173 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:51:16,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 142 transitions. [2019-11-15 20:51:16,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2019-11-15 20:51:16,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:51:16,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:51:16,176 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:16,182 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:16,182 INFO L791 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-15 20:51:16,183 INFO L793 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-15 20:51:16,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:16,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2019-11-15 20:51:16,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:16,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941061933] [2019-11-15 20:51:16,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,210 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:51:16,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:16,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1028489344, now seen corresponding path program 1 times [2019-11-15 20:51:16,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:16,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466013665] [2019-11-15 20:51:16,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,239 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:51:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:16,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1783037256, now seen corresponding path program 1 times [2019-11-15 20:51:16,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:16,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44826002] [2019-11-15 20:51:16,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:51:16,263 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-15 20:51:16,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44826002] [2019-11-15 20:51:16,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:51:16,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:51:16,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933370204] [2019-11-15 20:51:16,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:51:16,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:51:16,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:51:16,342 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. cyclomatic complexity: 39 Second operand 3 states. [2019-11-15 20:51:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:51:16,373 INFO L93 Difference]: Finished difference Result 184 states and 249 transitions. [2019-11-15 20:51:16,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:51:16,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 249 transitions. [2019-11-15 20:51:16,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2019-11-15 20:51:16,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 184 states and 249 transitions. [2019-11-15 20:51:16,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2019-11-15 20:51:16,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2019-11-15 20:51:16,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 249 transitions. [2019-11-15 20:51:16,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:51:16,381 INFO L688 BuchiCegarLoop]: Abstraction has 184 states and 249 transitions. [2019-11-15 20:51:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 249 transitions. [2019-11-15 20:51:16,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 146. [2019-11-15 20:51:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 20:51:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 197 transitions. [2019-11-15 20:51:16,391 INFO L711 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2019-11-15 20:51:16,391 INFO L591 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2019-11-15 20:51:16,391 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:51:16,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 197 transitions. [2019-11-15 20:51:16,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2019-11-15 20:51:16,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:51:16,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:51:16,394 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:16,394 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:51:16,394 INFO L791 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-15 20:51:16,394 INFO L793 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-15 20:51:16,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:16,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2019-11-15 20:51:16,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:16,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172095607] [2019-11-15 20:51:16,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,409 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:51:16,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:16,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1818395562, now seen corresponding path program 1 times [2019-11-15 20:51:16,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:16,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423946606] [2019-11-15 20:51:16,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,421 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:51:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:51:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash 560416882, now seen corresponding path program 1 times [2019-11-15 20:51:16,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:51:16,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300074801] [2019-11-15 20:51:16,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:51:16,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:51:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:51:16,440 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:51:16,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:51:16 BoogieIcfgContainer [2019-11-15 20:51:16,728 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:51:16,729 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:51:16,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:51:16,729 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:51:16,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:51:15" (3/4) ... [2019-11-15 20:51:16,733 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 20:51:16,821 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_733518ac-e11c-4c1d-bd64-02d688bfbba9/bin/uautomizer/witness.graphml [2019-11-15 20:51:16,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:51:16,824 INFO L168 Benchmark]: Toolchain (without parser) took 2668.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 941.0 MB in the beginning and 981.7 MB in the end (delta: -40.7 MB). Peak memory consumption was 105.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:16,825 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:51:16,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:16,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.18 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:16,830 INFO L168 Benchmark]: Boogie Preprocessor took 31.01 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-15 20:51:16,830 INFO L168 Benchmark]: RCFGBuilder took 544.68 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:16,831 INFO L168 Benchmark]: BuchiAutomizer took 1568.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.1 MB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:16,831 INFO L168 Benchmark]: Witness Printer took 92.76 ms. Allocated memory is still 1.2 GB. Free memory was 987.1 MB in the beginning and 981.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:51:16,834 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.18 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.01 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. * RCFGBuilder took 544.68 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1568.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.1 MB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 11.5 GB. * Witness Printer took 92.76 ms. Allocated memory is still 1.2 GB. Free memory was 987.1 MB in the beginning and 981.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 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.4s 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@34ba521e=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@6bd59a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31403cdf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20074f9c=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...