./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/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-6b5699a [2019-11-25 08:49:35,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:35,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:35,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:35,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:35,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:35,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:35,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:35,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:35,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:35,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:35,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:35,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:35,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:35,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:35,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:35,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:35,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:35,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:35,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:35,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:35,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:35,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:35,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:35,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:35,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:35,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:35,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:35,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:35,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:35,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:35,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:35,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:35,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:35,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:35,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:35,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:35,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:35,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:35,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:35,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:35,954 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-25 08:49:35,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:35,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:35,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:35,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:35,981 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:35,981 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:49:35,981 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:49:35,982 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:49:35,982 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:49:35,982 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:49:35,982 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:49:35,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:35,983 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:49:35,983 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:49:35,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:49:35,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:49:35,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:35,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:49:35,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:49:35,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:49:35,984 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:49:35,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:35,985 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:49:35,985 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:35,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:49:35,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:35,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:35,986 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:49:35,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:35,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:49:35,987 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:49:35,988 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:49:35,988 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_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/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-25 08:49:36,159 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:36,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:36,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:36,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:36,178 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:36,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-25 08:49:36,240 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/bin/uautomizer/data/7f8c973ae/f565e8962f6d4f9fa115b45715794bea/FLAG07a9ce204 [2019-11-25 08:49:36,698 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:36,698 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2019-11-25 08:49:36,708 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/bin/uautomizer/data/7f8c973ae/f565e8962f6d4f9fa115b45715794bea/FLAG07a9ce204 [2019-11-25 08:49:37,015 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/bin/uautomizer/data/7f8c973ae/f565e8962f6d4f9fa115b45715794bea [2019-11-25 08:49:37,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:37,020 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:37,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:37,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:37,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:37,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:37" (1/1) ... [2019-11-25 08:49:37,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2acbfa53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37, skipping insertion in model container [2019-11-25 08:49:37,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:37" (1/1) ... [2019-11-25 08:49:37,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:37,069 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:37,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:37,361 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:37,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:37,430 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:37,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37 WrapperNode [2019-11-25 08:49:37,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:37,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:37,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:37,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:37,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37" (1/1) ... [2019-11-25 08:49:37,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37" (1/1) ... [2019-11-25 08:49:37,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:37,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:37,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:37,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:37,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37" (1/1) ... [2019-11-25 08:49:37,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37" (1/1) ... [2019-11-25 08:49:37,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37" (1/1) ... [2019-11-25 08:49:37,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37" (1/1) ... [2019-11-25 08:49:37,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37" (1/1) ... [2019-11-25 08:49:37,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37" (1/1) ... [2019-11-25 08:49:37,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37" (1/1) ... [2019-11-25 08:49:37,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:37,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:37,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:37,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:37,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/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-25 08:49:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:37,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:38,191 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:38,191 INFO L284 CfgBuilder]: Removed 42 assume(true) statements. [2019-11-25 08:49:38,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:38 BoogieIcfgContainer [2019-11-25 08:49:38,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:38,193 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:49:38,194 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:49:38,197 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:49:38,198 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:49:38,199 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:49:37" (1/3) ... [2019-11-25 08:49:38,200 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60761f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:49:38, skipping insertion in model container [2019-11-25 08:49:38,200 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:49:38,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:37" (2/3) ... [2019-11-25 08:49:38,201 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60761f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:49:38, skipping insertion in model container [2019-11-25 08:49:38,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:49:38,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:38" (3/3) ... [2019-11-25 08:49:38,203 INFO L371 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-11-25 08:49:38,251 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:49:38,251 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:49:38,251 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:49:38,252 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:38,252 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:38,252 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:49:38,252 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:38,252 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:49:38,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2019-11-25 08:49:38,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-11-25 08:49:38,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:38,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:38,307 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:49:38,307 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:38,307 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:49:38,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states. [2019-11-25 08:49:38,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2019-11-25 08:49:38,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:38,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:38,314 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:49:38,314 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:38,322 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 8#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 74#L346true havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 76#L196true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 73#L196-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 60#L313-1true [2019-11-25 08:49:38,323 INFO L796 eck$LassoCheckResult]: Loop: 60#L313-1true assume !false; 22#L314true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 63#L262true assume false; 37#L278true havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 68#L214-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 14#L226-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 42#L227-1true stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 23#L292true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12#L299true stop_simulation_#res := stop_simulation_~__retres2~0; 39#L300true start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 65#L320true assume !(0 != start_simulation_~tmp~3); 60#L313-1true [2019-11-25 08:49:38,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:38,328 INFO L82 PathProgramCache]: Analyzing trace with hash 28692871, now seen corresponding path program 1 times [2019-11-25 08:49:38,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:38,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853836606] [2019-11-25 08:49:38,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:38,461 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-25 08:49:38,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853836606] [2019-11-25 08:49:38,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:38,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:38,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494460827] [2019-11-25 08:49:38,467 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:49:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash -168076210, now seen corresponding path program 1 times [2019-11-25 08:49:38,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:38,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776159670] [2019-11-25 08:49:38,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:38,479 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-25 08:49:38,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776159670] [2019-11-25 08:49:38,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:38,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:38,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159909063] [2019-11-25 08:49:38,483 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:49:38,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:38,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:38,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:38,501 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2019-11-25 08:49:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:38,522 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2019-11-25 08:49:38,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:38,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 103 transitions. [2019-11-25 08:49:38,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-25 08:49:38,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 97 transitions. [2019-11-25 08:49:38,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-25 08:49:38,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-25 08:49:38,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 97 transitions. [2019-11-25 08:49:38,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:49:38,536 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2019-11-25 08:49:38,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 97 transitions. [2019-11-25 08:49:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-25 08:49:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 08:49:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2019-11-25 08:49:38,575 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2019-11-25 08:49:38,575 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 97 transitions. [2019-11-25 08:49:38,575 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:49:38,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 97 transitions. [2019-11-25 08:49:38,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-25 08:49:38,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:38,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:38,578 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:49:38,578 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:38,579 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 167#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 168#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 224#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 223#L196-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 220#L313-1 [2019-11-25 08:49:38,579 INFO L796 eck$LassoCheckResult]: Loop: 220#L313-1 assume !false; 189#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 172#L262 assume !false; 211#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 212#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 183#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 184#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 197#L242 assume !(0 != eval_~tmp___1~0); 198#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 204#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 181#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 182#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 190#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 177#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 178#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 208#L320 assume !(0 != start_simulation_~tmp~3); 220#L313-1 [2019-11-25 08:49:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash 28692809, now seen corresponding path program 1 times [2019-11-25 08:49:38,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:38,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827275858] [2019-11-25 08:49:38,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:38,605 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-25 08:49:38,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827275858] [2019-11-25 08:49:38,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:38,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:38,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109468530] [2019-11-25 08:49:38,607 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:49:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:38,607 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 1 times [2019-11-25 08:49:38,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:38,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506076077] [2019-11-25 08:49:38,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:38,656 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-25 08:49:38,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506076077] [2019-11-25 08:49:38,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:38,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:38,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57758141] [2019-11-25 08:49:38,658 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:49:38,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:38,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:38,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:38,659 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. cyclomatic complexity: 30 Second operand 3 states. [2019-11-25 08:49:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:38,667 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2019-11-25 08:49:38,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:38,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 96 transitions. [2019-11-25 08:49:38,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-25 08:49:38,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 96 transitions. [2019-11-25 08:49:38,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-25 08:49:38,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2019-11-25 08:49:38,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 96 transitions. [2019-11-25 08:49:38,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:49:38,682 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-25 08:49:38,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 96 transitions. [2019-11-25 08:49:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-25 08:49:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 08:49:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2019-11-25 08:49:38,692 INFO L711 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-25 08:49:38,693 INFO L591 BuchiCegarLoop]: Abstraction has 68 states and 96 transitions. [2019-11-25 08:49:38,693 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:49:38,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 96 transitions. [2019-11-25 08:49:38,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2019-11-25 08:49:38,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:38,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:38,699 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:49:38,699 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:38,700 INFO L794 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 312#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 313#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 369#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 368#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 365#L313-1 [2019-11-25 08:49:38,700 INFO L796 eck$LassoCheckResult]: Loop: 365#L313-1 assume !false; 334#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 317#L262 assume !false; 356#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 357#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 328#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 329#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 342#L242 assume !(0 != eval_~tmp___1~0); 343#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 349#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 326#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 327#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 335#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 322#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 323#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 350#L320 assume !(0 != start_simulation_~tmp~3); 365#L313-1 [2019-11-25 08:49:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:38,700 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 1 times [2019-11-25 08:49:38,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:38,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177872031] [2019-11-25 08:49:38,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:38,738 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:38,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:38,738 INFO L82 PathProgramCache]: Analyzing trace with hash -241927711, now seen corresponding path program 2 times [2019-11-25 08:49:38,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:38,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520094392] [2019-11-25 08:49:38,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:38,774 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-25 08:49:38,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520094392] [2019-11-25 08:49:38,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:38,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:38,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947427255] [2019-11-25 08:49:38,775 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:49:38,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:38,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:38,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:38,776 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. cyclomatic complexity: 29 Second operand 5 states. [2019-11-25 08:49:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:38,930 INFO L93 Difference]: Finished difference Result 134 states and 187 transitions. [2019-11-25 08:49:38,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:49:38,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 187 transitions. [2019-11-25 08:49:38,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 129 [2019-11-25 08:49:38,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 187 transitions. [2019-11-25 08:49:38,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-11-25 08:49:38,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-11-25 08:49:38,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 187 transitions. [2019-11-25 08:49:38,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:49:38,942 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-11-25 08:49:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 187 transitions. [2019-11-25 08:49:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 71. [2019-11-25 08:49:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-25 08:49:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2019-11-25 08:49:38,951 INFO L711 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-11-25 08:49:38,951 INFO L591 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2019-11-25 08:49:38,951 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:49:38,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2019-11-25 08:49:38,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2019-11-25 08:49:38,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:38,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:38,955 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:49:38,955 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-25 08:49:38,955 INFO L794 eck$LassoCheckResult]: Stem: 563#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 530#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 531#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 589#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 588#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 585#L313-1 [2019-11-25 08:49:38,955 INFO L796 eck$LassoCheckResult]: Loop: 585#L313-1 assume !false; 552#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 533#L262 assume !false; 575#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 576#L214 assume !(0 == ~p_dw_st~0); 583#L218 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2 := 0; 546#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 547#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 590#L242 assume !(0 != eval_~tmp___1~0); 566#L278 havoc stop_simulation_#res;havoc stop_simulation_#t~ret6, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 567#L214-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 544#L226-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 545#L227-1 stop_simulation_#t~ret6 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret6;havoc stop_simulation_#t~ret6; 553#L292 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 540#L299 stop_simulation_#res := stop_simulation_~__retres2~0; 541#L300 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp~3 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 570#L320 assume !(0 != start_simulation_~tmp~3); 585#L313-1 [2019-11-25 08:49:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash 28692807, now seen corresponding path program 2 times [2019-11-25 08:49:38,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:38,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126249623] [2019-11-25 08:49:38,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:39,000 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:39,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:39,000 INFO L82 PathProgramCache]: Analyzing trace with hash 616414076, now seen corresponding path program 1 times [2019-11-25 08:49:39,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:39,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801740764] [2019-11-25 08:49:39,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:39,036 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-25 08:49:39,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801740764] [2019-11-25 08:49:39,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:39,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:39,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125758098] [2019-11-25 08:49:39,037 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-25 08:49:39,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:39,038 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand 3 states. [2019-11-25 08:49:39,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:39,066 INFO L93 Difference]: Finished difference Result 121 states and 166 transitions. [2019-11-25 08:49:39,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:39,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 166 transitions. [2019-11-25 08:49:39,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2019-11-25 08:49:39,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 166 transitions. [2019-11-25 08:49:39,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2019-11-25 08:49:39,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2019-11-25 08:49:39,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 166 transitions. [2019-11-25 08:49:39,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:49:39,072 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 166 transitions. [2019-11-25 08:49:39,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 166 transitions. [2019-11-25 08:49:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2019-11-25 08:49:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-25 08:49:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 142 transitions. [2019-11-25 08:49:39,079 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2019-11-25 08:49:39,079 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 142 transitions. [2019-11-25 08:49:39,080 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:49:39,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 142 transitions. [2019-11-25 08:49:39,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 97 [2019-11-25 08:49:39,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:39,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:39,081 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:39,082 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:39,082 INFO L794 eck$LassoCheckResult]: Stem: 761#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 728#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 729#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 793#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 791#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 792#L313-1 assume !false; 805#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 802#L262 [2019-11-25 08:49:39,082 INFO L796 eck$LassoCheckResult]: Loop: 802#L262 assume !false; 801#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 800#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 799#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 798#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 797#L242 assume 0 != eval_~tmp___1~0; 796#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 786#L251 assume !(0 != eval_~tmp~1); 787#L247 assume !(0 == ~c_dr_st~0); 802#L262 [2019-11-25 08:49:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:39,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 1 times [2019-11-25 08:49:39,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:39,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797993596] [2019-11-25 08:49:39,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:39,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1028489344, now seen corresponding path program 1 times [2019-11-25 08:49:39,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:39,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472244064] [2019-11-25 08:49:39,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:39,116 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:39,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1783037256, now seen corresponding path program 1 times [2019-11-25 08:49:39,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:39,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067721154] [2019-11-25 08:49:39,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:39,154 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-25 08:49:39,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067721154] [2019-11-25 08:49:39,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:39,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:49:39,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619914025] [2019-11-25 08:49:39,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:39,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:39,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:39,229 INFO L87 Difference]: Start difference. First operand 104 states and 142 transitions. cyclomatic complexity: 39 Second operand 3 states. [2019-11-25 08:49:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:39,279 INFO L93 Difference]: Finished difference Result 184 states and 249 transitions. [2019-11-25 08:49:39,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:39,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 249 transitions. [2019-11-25 08:49:39,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 177 [2019-11-25 08:49:39,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 184 states and 249 transitions. [2019-11-25 08:49:39,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2019-11-25 08:49:39,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2019-11-25 08:49:39,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 249 transitions. [2019-11-25 08:49:39,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:49:39,285 INFO L688 BuchiCegarLoop]: Abstraction has 184 states and 249 transitions. [2019-11-25 08:49:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 249 transitions. [2019-11-25 08:49:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 146. [2019-11-25 08:49:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 08:49:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 197 transitions. [2019-11-25 08:49:39,302 INFO L711 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2019-11-25 08:49:39,302 INFO L591 BuchiCegarLoop]: Abstraction has 146 states and 197 transitions. [2019-11-25 08:49:39,302 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:49:39,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 197 transitions. [2019-11-25 08:49:39,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2019-11-25 08:49:39,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:39,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:39,307 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:39,307 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:39,307 INFO L794 eck$LassoCheckResult]: Stem: 1058#ULTIMATE.startENTRY ~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1024#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1025#L346 havoc start_simulation_#t~ret7, start_simulation_~kernel_st~0, start_simulation_~tmp~3;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;start_simulation_~kernel_st~0 := 0; 1096#L196 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1095#L196-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1087#L313-1 assume !false; 1047#L314 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret3, eval_#t~nondet4, eval_#t~nondet5, eval_~tmp~1, eval_~tmp___0~1, eval_~tmp___1~0;havoc eval_~tmp~1;havoc eval_~tmp___0~1;havoc eval_~tmp___1~0; 1027#L262 [2019-11-25 08:49:39,307 INFO L796 eck$LassoCheckResult]: Loop: 1027#L262 assume !false; 1141#L238 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1139#L214 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2 := 1; 1138#L226 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1137#L227 eval_#t~ret3 := exists_runnable_thread_#res;eval_~tmp___1~0 := eval_#t~ret3;havoc eval_#t~ret3; 1136#L242 assume 0 != eval_~tmp___1~0; 1135#L242-1 assume 0 == ~p_dw_st~0;eval_~tmp~1 := eval_#t~nondet4;havoc eval_#t~nondet4; 1088#L251 assume !(0 != eval_~tmp~1); 1089#L247 assume 0 == ~c_dr_st~0;eval_~tmp___0~1 := eval_#t~nondet5;havoc eval_#t~nondet5; 1026#L266 assume !(0 != eval_~tmp___0~1); 1027#L262 [2019-11-25 08:49:39,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:39,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1803984585, now seen corresponding path program 2 times [2019-11-25 08:49:39,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:39,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641126535] [2019-11-25 08:49:39,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:39,329 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:39,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:39,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1818395562, now seen corresponding path program 1 times [2019-11-25 08:49:39,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:39,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730026592] [2019-11-25 08:49:39,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:39,340 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:39,341 INFO L82 PathProgramCache]: Analyzing trace with hash 560416882, now seen corresponding path program 1 times [2019-11-25 08:49:39,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:39,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613082995] [2019-11-25 08:49:39,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:39,370 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:39,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:49:39 BoogieIcfgContainer [2019-11-25 08:49:39,617 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:49:39,618 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:49:39,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:49:39,618 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:49:39,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:38" (3/4) ... [2019-11-25 08:49:39,623 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-25 08:49:39,693 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_93c8fd6c-7d83-48dd-b20d-9f9d5ec8bde1/bin/uautomizer/witness.graphml [2019-11-25 08:49:39,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:49:39,699 INFO L168 Benchmark]: Toolchain (without parser) took 2678.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.1 MB in the beginning and 986.5 MB in the end (delta: -36.4 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:39,699 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:39,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:39,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.94 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-25 08:49:39,700 INFO L168 Benchmark]: Boogie Preprocessor took 33.42 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-25 08:49:39,701 INFO L168 Benchmark]: RCFGBuilder took 669.88 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:39,701 INFO L168 Benchmark]: BuchiAutomizer took 1423.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.5 MB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:39,702 INFO L168 Benchmark]: Witness Printer took 78.90 ms. Allocated memory is still 1.2 GB. Free memory is still 986.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:39,703 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 410.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.94 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 33.42 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 669.88 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1423.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.5 MB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 11.5 GB. * Witness Printer took 78.90 ms. Allocated memory is still 1.2 GB. Free memory is still 986.5 MB. There was no memory consumed. 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.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. 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@20cd9aa2=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@5b099c2a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d8bc6db=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31f2f90c=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...