./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 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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 a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.0-5485861 [2020-10-26 05:46:12,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 05:46:12,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 05:46:12,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 05:46:12,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 05:46:12,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 05:46:12,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 05:46:12,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 05:46:12,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 05:46:12,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 05:46:12,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 05:46:12,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 05:46:12,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 05:46:12,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 05:46:12,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 05:46:12,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 05:46:12,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 05:46:12,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 05:46:12,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 05:46:12,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 05:46:12,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 05:46:12,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 05:46:12,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 05:46:12,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 05:46:12,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 05:46:12,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 05:46:12,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 05:46:12,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 05:46:12,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 05:46:12,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 05:46:12,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 05:46:12,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 05:46:12,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 05:46:12,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 05:46:12,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 05:46:12,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 05:46:12,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 05:46:12,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 05:46:12,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 05:46:12,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 05:46:12,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 05:46:12,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 05:46:12,896 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 05:46:12,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 05:46:12,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 05:46:12,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 05:46:12,903 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 05:46:12,903 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 05:46:12,903 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 05:46:12,904 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 05:46:12,904 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 05:46:12,904 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 05:46:12,905 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 05:46:12,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 05:46:12,906 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 05:46:12,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 05:46:12,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 05:46:12,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 05:46:12,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 05:46:12,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 05:46:12,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 05:46:12,908 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 05:46:12,908 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 05:46:12,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 05:46:12,909 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 05:46:12,910 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 05:46:12,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 05:46:12,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 05:46:12,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 05:46:12,911 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 05:46:12,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 05:46:12,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 05:46:12,912 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 05:46:12,912 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 05:46:12,915 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 05:46:12,915 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 [2020-10-26 05:46:13,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 05:46:13,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 05:46:13,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 05:46:13,402 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 05:46:13,404 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 05:46:13,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2020-10-26 05:46:13,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95474795/64087cdda9c24e6b8c561f84da4e05fc/FLAG0f6c26024 [2020-10-26 05:46:14,104 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 05:46:14,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2020-10-26 05:46:14,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95474795/64087cdda9c24e6b8c561f84da4e05fc/FLAG0f6c26024 [2020-10-26 05:46:14,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95474795/64087cdda9c24e6b8c561f84da4e05fc [2020-10-26 05:46:14,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 05:46:14,502 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 05:46:14,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 05:46:14,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 05:46:14,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 05:46:14,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:46:14" (1/1) ... [2020-10-26 05:46:14,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ba0566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14, skipping insertion in model container [2020-10-26 05:46:14,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 05:46:14" (1/1) ... [2020-10-26 05:46:14,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 05:46:14,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 05:46:14,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:46:14,803 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 05:46:14,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 05:46:14,872 INFO L208 MainTranslator]: Completed translation [2020-10-26 05:46:14,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14 WrapperNode [2020-10-26 05:46:14,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 05:46:14,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 05:46:14,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 05:46:14,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 05:46:14,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14" (1/1) ... [2020-10-26 05:46:14,910 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14" (1/1) ... [2020-10-26 05:46:14,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 05:46:14,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 05:46:14,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 05:46:14,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 05:46:14,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14" (1/1) ... [2020-10-26 05:46:14,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14" (1/1) ... [2020-10-26 05:46:14,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14" (1/1) ... [2020-10-26 05:46:14,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14" (1/1) ... [2020-10-26 05:46:14,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14" (1/1) ... [2020-10-26 05:46:14,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14" (1/1) ... [2020-10-26 05:46:14,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14" (1/1) ... [2020-10-26 05:46:14,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 05:46:14,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 05:46:14,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 05:46:14,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 05:46:14,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14" (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 [2020-10-26 05:46:15,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 05:46:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 05:46:15,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 05:46:15,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 05:46:15,490 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 05:46:15,491 INFO L298 CfgBuilder]: Removed 46 assume(true) statements. [2020-10-26 05:46:15,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:46:15 BoogieIcfgContainer [2020-10-26 05:46:15,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 05:46:15,507 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 05:46:15,507 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 05:46:15,514 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 05:46:15,520 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:46:15,520 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 05:46:14" (1/3) ... [2020-10-26 05:46:15,521 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dd98137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:46:15, skipping insertion in model container [2020-10-26 05:46:15,521 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:46:15,522 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 05:46:14" (2/3) ... [2020-10-26 05:46:15,524 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dd98137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 05:46:15, skipping insertion in model container [2020-10-26 05:46:15,524 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 05:46:15,524 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:46:15" (3/3) ... [2020-10-26 05:46:15,528 INFO L373 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-10-26 05:46:15,572 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 05:46:15,572 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 05:46:15,572 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 05:46:15,573 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 05:46:15,573 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 05:46:15,573 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 05:46:15,573 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 05:46:15,573 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 05:46:15,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2020-10-26 05:46:15,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2020-10-26 05:46:15,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:15,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:15,633 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 05:46:15,633 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:15,634 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 05:46:15,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states. [2020-10-26 05:46:15,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2020-10-26 05:46:15,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:15,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:15,642 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 05:46:15,642 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:15,651 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 32#L348true havoc start_simulation_#t~ret14, 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; 23#L198true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 39#L198-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 36#L315-1true [2020-10-26 05:46:15,652 INFO L796 eck$LassoCheckResult]: Loop: 36#L315-1true assume !false; 52#L316true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, 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; 28#L264true assume false; 73#L280true havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, 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; 33#L216-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 56#L228-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 78#L229-1true stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 43#L294true assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 54#L301true stop_simulation_#res := stop_simulation_~__retres2~0; 75#L302true start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 24#L322true assume !(0 != start_simulation_~tmp~3); 36#L315-1true [2020-10-26 05:46:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:15,662 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2020-10-26 05:46:15,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:15,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901518182] [2020-10-26 05:46:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:46:15,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901518182] [2020-10-26 05:46:15,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:15,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:15,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011230519] [2020-10-26 05:46:15,945 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:15,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1881638668, now seen corresponding path program 1 times [2020-10-26 05:46:15,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:15,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302696971] [2020-10-26 05:46:15,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:46:15,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302696971] [2020-10-26 05:46:15,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:15,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 05:46:15,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015509215] [2020-10-26 05:46:15,960 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:15,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:15,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:15,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:15,982 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2020-10-26 05:46:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:16,009 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2020-10-26 05:46:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:16,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2020-10-26 05:46:16,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2020-10-26 05:46:16,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 97 transitions. [2020-10-26 05:46:16,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-10-26 05:46:16,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-10-26 05:46:16,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 97 transitions. [2020-10-26 05:46:16,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:16,026 INFO L691 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2020-10-26 05:46:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 97 transitions. [2020-10-26 05:46:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-10-26 05:46:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-26 05:46:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2020-10-26 05:46:16,078 INFO L714 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2020-10-26 05:46:16,078 INFO L594 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2020-10-26 05:46:16,078 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 05:46:16,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 97 transitions. [2020-10-26 05:46:16,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2020-10-26 05:46:16,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:16,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:16,082 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 05:46:16,082 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:16,083 INFO L794 eck$LassoCheckResult]: Stem: 199#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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#L348 havoc start_simulation_#t~ret14, 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; 188#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 189#L198-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 191#L315-1 [2020-10-26 05:46:16,083 INFO L796 eck$LassoCheckResult]: Loop: 191#L315-1 assume !false; 203#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, 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; 184#L264 assume !false; 198#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 201#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 193#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 221#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 222#L244 assume !(0 != eval_~tmp___1~0); 226#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, 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; 200#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 187#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 220#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 209#L294 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 210#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 218#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 190#L322 assume !(0 != start_simulation_~tmp~3); 191#L315-1 [2020-10-26 05:46:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,084 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2020-10-26 05:46:16,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504528714] [2020-10-26 05:46:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:46:16,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504528714] [2020-10-26 05:46:16,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:16,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 05:46:16,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656968122] [2020-10-26 05:46:16,124 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 05:46:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1807787167, now seen corresponding path program 1 times [2020-10-26 05:46:16,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355701755] [2020-10-26 05:46:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:46:16,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355701755] [2020-10-26 05:46:16,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:16,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:16,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127574046] [2020-10-26 05:46:16,176 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:16,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:16,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:16,178 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. cyclomatic complexity: 30 Second operand 3 states. [2020-10-26 05:46:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:16,190 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2020-10-26 05:46:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:16,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 96 transitions. [2020-10-26 05:46:16,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2020-10-26 05:46:16,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 96 transitions. [2020-10-26 05:46:16,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2020-10-26 05:46:16,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2020-10-26 05:46:16,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2020-10-26 05:46:16,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:16,198 INFO L691 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2020-10-26 05:46:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2020-10-26 05:46:16,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-10-26 05:46:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-26 05:46:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2020-10-26 05:46:16,204 INFO L714 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2020-10-26 05:46:16,204 INFO L594 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2020-10-26 05:46:16,204 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 05:46:16,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2020-10-26 05:46:16,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2020-10-26 05:46:16,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:16,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:16,207 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 05:46:16,207 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:16,208 INFO L794 eck$LassoCheckResult]: Stem: 344#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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#L348 havoc start_simulation_#t~ret14, 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; 333#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 334#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 336#L315-1 [2020-10-26 05:46:16,208 INFO L796 eck$LassoCheckResult]: Loop: 336#L315-1 assume !false; 349#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, 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; 329#L264 assume !false; 343#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 346#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 338#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 366#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 367#L244 assume !(0 != eval_~tmp___1~0); 371#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, 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; 345#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 332#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 365#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 354#L294 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 355#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 363#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 335#L322 assume !(0 != start_simulation_~tmp~3); 336#L315-1 [2020-10-26 05:46:16,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,209 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2020-10-26 05:46:16,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69968718] [2020-10-26 05:46:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,227 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,295 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:16,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1807787167, now seen corresponding path program 2 times [2020-10-26 05:46:16,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089606366] [2020-10-26 05:46:16,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:46:16,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089606366] [2020-10-26 05:46:16,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:16,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 05:46:16,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815458437] [2020-10-26 05:46:16,366 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:16,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:16,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 05:46:16,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 05:46:16,368 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 5 states. [2020-10-26 05:46:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:16,497 INFO L93 Difference]: Finished difference Result 134 states and 187 transitions. [2020-10-26 05:46:16,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 05:46:16,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 187 transitions. [2020-10-26 05:46:16,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2020-10-26 05:46:16,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 187 transitions. [2020-10-26 05:46:16,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2020-10-26 05:46:16,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2020-10-26 05:46:16,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 187 transitions. [2020-10-26 05:46:16,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:16,505 INFO L691 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2020-10-26 05:46:16,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 187 transitions. [2020-10-26 05:46:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2020-10-26 05:46:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-26 05:46:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2020-10-26 05:46:16,512 INFO L714 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2020-10-26 05:46:16,512 INFO L594 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2020-10-26 05:46:16,512 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 05:46:16,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2020-10-26 05:46:16,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-10-26 05:46:16,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:16,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:16,514 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 05:46:16,514 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:16,515 INFO L794 eck$LassoCheckResult]: Stem: 563#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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#L348 havoc start_simulation_#t~ret14, 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; 551#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 552#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 554#L315-1 [2020-10-26 05:46:16,515 INFO L796 eck$LassoCheckResult]: Loop: 554#L315-1 assume !false; 567#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, 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; 547#L264 assume !false; 562#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 565#L216 assume !(0 == ~p_dw_st~0); 555#L220 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 556#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 592#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 591#L244 assume !(0 != eval_~tmp___1~0); 590#L280 havoc stop_simulation_#res;havoc stop_simulation_#t~ret13, 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; 564#L216-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 550#L228-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 584#L229-1 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 573#L294 assume !(0 != stop_simulation_~tmp~2);stop_simulation_~__retres2~0 := 1; 574#L301 stop_simulation_#res := stop_simulation_~__retres2~0; 582#L302 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 553#L322 assume !(0 != start_simulation_~tmp~3); 554#L315-1 [2020-10-26 05:46:16,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2020-10-26 05:46:16,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223111711] [2020-10-26 05:46:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,549 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:16,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1628838342, now seen corresponding path program 1 times [2020-10-26 05:46:16,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452354223] [2020-10-26 05:46:16,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:46:16,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452354223] [2020-10-26 05:46:16,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:16,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 05:46:16,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460310701] [2020-10-26 05:46:16,568 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 05:46:16,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:16,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:16,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:16,569 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-10-26 05:46:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:16,599 INFO L93 Difference]: Finished difference Result 121 states and 166 transitions. [2020-10-26 05:46:16,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:16,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 166 transitions. [2020-10-26 05:46:16,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2020-10-26 05:46:16,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 166 transitions. [2020-10-26 05:46:16,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2020-10-26 05:46:16,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2020-10-26 05:46:16,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 166 transitions. [2020-10-26 05:46:16,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:16,604 INFO L691 BuchiCegarLoop]: Abstraction has 121 states and 166 transitions. [2020-10-26 05:46:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 166 transitions. [2020-10-26 05:46:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2020-10-26 05:46:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-26 05:46:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2020-10-26 05:46:16,619 INFO L714 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2020-10-26 05:46:16,619 INFO L594 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2020-10-26 05:46:16,619 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 05:46:16,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 142 transitions. [2020-10-26 05:46:16,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2020-10-26 05:46:16,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:16,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:16,621 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:16,621 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:16,622 INFO L794 eck$LassoCheckResult]: Stem: 763#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 729#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; 730#L348 havoc start_simulation_#t~ret14, 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; 751#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 752#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 772#L315-1 assume !false; 809#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, 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; 805#L264 [2020-10-26 05:46:16,622 INFO L796 eck$LassoCheckResult]: Loop: 805#L264 assume !false; 804#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 803#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 790#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 791#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 792#L244 assume 0 != eval_~tmp___1~0; 797#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 758#L253 assume !(0 != eval_~tmp~1); 759#L249 assume !(0 == ~c_dr_st~0); 805#L264 [2020-10-26 05:46:16,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2020-10-26 05:46:16,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469227502] [2020-10-26 05:46:16,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,639 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,656 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1028489348, now seen corresponding path program 1 times [2020-10-26 05:46:16,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232879929] [2020-10-26 05:46:16,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,671 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1783037252, now seen corresponding path program 1 times [2020-10-26 05:46:16,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753673758] [2020-10-26 05:46:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 05:46:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 05:46:16,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753673758] [2020-10-26 05:46:16,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 05:46:16,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 05:46:16,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093310012] [2020-10-26 05:46:16,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 05:46:16,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 05:46:16,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 05:46:16,771 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. cyclomatic complexity: 39 Second operand 3 states. [2020-10-26 05:46:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 05:46:16,802 INFO L93 Difference]: Finished difference Result 184 states and 249 transitions. [2020-10-26 05:46:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 05:46:16,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 249 transitions. [2020-10-26 05:46:16,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2020-10-26 05:46:16,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 184 states and 249 transitions. [2020-10-26 05:46:16,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2020-10-26 05:46:16,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2020-10-26 05:46:16,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 249 transitions. [2020-10-26 05:46:16,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 05:46:16,809 INFO L691 BuchiCegarLoop]: Abstraction has 184 states and 249 transitions. [2020-10-26 05:46:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 249 transitions. [2020-10-26 05:46:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 146. [2020-10-26 05:46:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-10-26 05:46:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 197 transitions. [2020-10-26 05:46:16,829 INFO L714 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2020-10-26 05:46:16,829 INFO L594 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2020-10-26 05:46:16,829 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-26 05:46:16,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 197 transitions. [2020-10-26 05:46:16,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2020-10-26 05:46:16,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 05:46:16,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 05:46:16,832 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:16,832 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 05:46:16,832 INFO L794 eck$LassoCheckResult]: Stem: 1059#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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; 1025#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; 1026#L348 havoc start_simulation_#t~ret14, 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; 1047#L198 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1048#L198-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1069#L315-1 assume !false; 1139#L316 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret10, eval_#t~nondet11, eval_#t~nondet12, 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; 1137#L264 [2020-10-26 05:46:16,832 INFO L796 eck$LassoCheckResult]: Loop: 1137#L264 assume !false; 1134#L240 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1132#L216 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1130#L228 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1128#L229 eval_#t~ret10 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret10;havoc eval_#t~ret10; 1126#L244 assume 0 != eval_~tmp___1~0; 1124#L244-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet11;havoc eval_#t~nondet11; 1118#L253 assume !(0 != eval_~tmp~1); 1120#L249 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet12;havoc eval_#t~nondet12; 1138#L268 assume !(0 != eval_~tmp___0~1); 1137#L264 [2020-10-26 05:46:16,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2020-10-26 05:46:16,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252485153] [2020-10-26 05:46:16,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,844 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,854 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,859 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:16,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1818395566, now seen corresponding path program 1 times [2020-10-26 05:46:16,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214376103] [2020-10-26 05:46:16,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,869 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,873 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 05:46:16,873 INFO L82 PathProgramCache]: Analyzing trace with hash 560416886, now seen corresponding path program 1 times [2020-10-26 05:46:16,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 05:46:16,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411299920] [2020-10-26 05:46:16,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 05:46:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 05:46:16,895 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 05:46:16,902 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 05:46:17,470 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2020-10-26 05:46:17,635 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-26 05:46:17,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 05:46:17 BoogieIcfgContainer [2020-10-26 05:46:17,668 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 05:46:17,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 05:46:17,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 05:46:17,669 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 05:46:17,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 05:46:15" (3/4) ... [2020-10-26 05:46:17,673 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-26 05:46:17,723 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 05:46:17,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 05:46:17,725 INFO L168 Benchmark]: Toolchain (without parser) took 3226.63 ms. Allocated memory was 44.0 MB in the beginning and 81.8 MB in the end (delta: 37.7 MB). Free memory was 19.6 MB in the beginning and 38.0 MB in the end (delta: -18.4 MB). Peak memory consumption was 21.3 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:17,725 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 44.0 MB. Free memory is still 28.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 05:46:17,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.89 ms. Allocated memory is still 54.5 MB. Free memory was 38.7 MB in the beginning and 27.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:17,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.64 ms. Allocated memory is still 54.5 MB. Free memory was 26.9 MB in the beginning and 25.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:17,727 INFO L168 Benchmark]: Boogie Preprocessor took 37.55 ms. Allocated memory is still 54.5 MB. Free memory was 25.0 MB in the beginning and 37.1 MB in the end (delta: -12.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:17,728 INFO L168 Benchmark]: RCFGBuilder took 508.58 ms. Allocated memory is still 54.5 MB. Free memory was 37.1 MB in the beginning and 25.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:17,728 INFO L168 Benchmark]: BuchiAutomizer took 2161.61 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 25.9 MB in the beginning and 40.0 MB in the end (delta: -14.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:17,729 INFO L168 Benchmark]: Witness Printer took 54.27 ms. Allocated memory is still 81.8 MB. Free memory was 40.0 MB in the beginning and 38.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 05:46:17,732 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 44.0 MB. Free memory is still 28.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 329.89 ms. Allocated memory is still 54.5 MB. Free memory was 38.7 MB in the beginning and 27.1 MB in the end (delta: 11.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.64 ms. Allocated memory is still 54.5 MB. Free memory was 26.9 MB in the beginning and 25.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.55 ms. Allocated memory is still 54.5 MB. Free memory was 25.0 MB in the beginning and 37.1 MB in the end (delta: -12.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 508.58 ms. Allocated memory is still 54.5 MB. Free memory was 37.1 MB in the beginning and 25.9 MB in the end (delta: 11.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 2161.61 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 25.9 MB in the beginning and 40.0 MB in the end (delta: -14.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 16.1 GB. * Witness Printer took 54.27 ms. Allocated memory is still 81.8 MB. Free memory was 40.0 MB in the beginning and 38.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 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 2.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. 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: 239]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=25783} State at position 1 is {p_last_write=0, c_dr_i=1, c_dr_pc=0, NULL=25786, a_t=0, NULL=0, \result=0, NULL=25783, c_num_read=0, tmp=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, NULL=25785, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@326cf764=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@410a1a3b=0, p_dw_pc=0, NULL=0, NULL=0, NULL=0, tmp=0, q_free=1, NULL=25784, p_dw_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25be95ee=0, c_last_read=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@387d9f45=0, p_num_write=0, q_buf_0=0, __retres1=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 239]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int q_buf_0 ; [L17] int q_free ; [L18] int q_read_ev ; [L19] int q_write_ev ; [L20] int p_num_write ; [L21] int p_last_write ; [L22] int p_dw_st ; [L23] int p_dw_pc ; [L24] int p_dw_i ; [L25] int c_num_read ; [L26] int c_last_read ; [L27] int c_dr_st ; [L28] int c_dr_pc ; [L29] int c_dr_i ; [L136] static int a_t ; [L352] int __retres1 ; [L338] q_free = 1 [L339] q_write_ev = 2 [L340] q_read_ev = q_write_ev [L341] p_num_write = 0 [L342] p_dw_pc = 0 [L343] p_dw_i = 1 [L344] c_num_read = 0 [L345] c_dr_pc = 0 [L346] c_dr_i = 1 [L306] int kernel_st ; [L307] int tmp ; [L311] kernel_st = 0 [L198] COND TRUE (int )p_dw_i == 1 [L199] p_dw_st = 0 [L203] COND TRUE (int )c_dr_i == 1 [L204] c_dr_st = 0 [L315] COND TRUE 1 [L318] kernel_st = 1 [L233] int tmp ; [L234] int tmp___0 ; [L235] int tmp___1 ; Loop: [L239] COND TRUE 1 [L213] int __retres1 ; [L216] COND TRUE (int )p_dw_st == 0 [L217] __retres1 = 1 [L229] return (__retres1); [L242] tmp___1 = exists_runnable_thread() [L244] COND TRUE \read(tmp___1) [L249] COND TRUE (int )p_dw_st == 0 [L251] tmp = __VERIFIER_nondet_int() [L253] COND FALSE !(\read(tmp)) [L264] COND TRUE (int )c_dr_st == 0 [L266] tmp___0 = __VERIFIER_nondet_int() [L268] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...