./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC --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 6325feb12f40756470caf3b12878fd0ec9ad6f61 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-7b2dab5 [2021-10-11 00:31:04,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:31:04,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:31:04,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:31:04,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:31:04,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:31:04,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:31:04,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:31:04,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:31:04,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:31:04,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:31:04,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:31:04,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:31:04,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:31:04,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:31:04,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:31:04,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:31:04,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:31:04,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:31:04,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:31:04,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:31:04,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:31:04,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:31:04,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:31:04,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:31:04,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:31:04,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:31:04,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:31:04,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:31:04,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:31:04,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:31:04,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:31:04,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:31:04,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:31:04,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:31:04,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:31:04,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:31:04,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:31:04,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:31:04,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:31:04,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:31:04,792 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-11 00:31:04,816 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:31:04,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:31:04,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:31:04,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:31:04,818 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:31:04,819 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-11 00:31:04,819 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-11 00:31:04,820 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-11 00:31:04,820 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-11 00:31:04,820 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-11 00:31:04,821 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-11 00:31:04,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:31:04,821 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:31:04,822 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-11 00:31:04,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:31:04,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:31:04,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:31:04,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-11 00:31:04,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-11 00:31:04,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-11 00:31:04,824 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:31:04,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:31:04,825 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-11 00:31:04,825 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:31:04,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-11 00:31:04,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:31:04,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:31:04,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:31:04,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:31:04,827 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:31:04,828 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-11 00:31:04,828 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC 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 -> 6325feb12f40756470caf3b12878fd0ec9ad6f61 [2021-10-11 00:31:05,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:31:05,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:31:05,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:31:05,102 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:31:05,113 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:31:05,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-11 00:31:05,177 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/data/30a646724/ca1327fc38244d5fa6eab27ac4e6c012/FLAGb8bbac594 [2021-10-11 00:31:05,610 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:31:05,611 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-11 00:31:05,625 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/data/30a646724/ca1327fc38244d5fa6eab27ac4e6c012/FLAGb8bbac594 [2021-10-11 00:31:05,984 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/data/30a646724/ca1327fc38244d5fa6eab27ac4e6c012 [2021-10-11 00:31:05,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:31:05,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:31:05,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:31:05,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:31:05,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:31:05,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:31:05" (1/1) ... [2021-10-11 00:31:05,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1685c5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:05, skipping insertion in model container [2021-10-11 00:31:05,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:31:05" (1/1) ... [2021-10-11 00:31:06,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:31:06,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:31:06,192 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-11 00:31:06,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:31:06,266 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:31:06,277 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-11 00:31:06,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:31:06,326 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:31:06,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06 WrapperNode [2021-10-11 00:31:06,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:31:06,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:31:06,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:31:06,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:31:06,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06" (1/1) ... [2021-10-11 00:31:06,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06" (1/1) ... [2021-10-11 00:31:06,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:31:06,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:31:06,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:31:06,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:31:06,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06" (1/1) ... [2021-10-11 00:31:06,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06" (1/1) ... [2021-10-11 00:31:06,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06" (1/1) ... [2021-10-11 00:31:06,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06" (1/1) ... [2021-10-11 00:31:06,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06" (1/1) ... [2021-10-11 00:31:06,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06" (1/1) ... [2021-10-11 00:31:06,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06" (1/1) ... [2021-10-11 00:31:06,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:31:06,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:31:06,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:31:06,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:31:06,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:31:06,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:31:06,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:31:06,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:31:06,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:31:07,093 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:31:07,093 INFO L299 CfgBuilder]: Removed 80 assume(true) statements. [2021-10-11 00:31:07,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:31:07 BoogieIcfgContainer [2021-10-11 00:31:07,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:31:07,096 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-11 00:31:07,097 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-11 00:31:07,111 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-11 00:31:07,127 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:31:07,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 11.10 12:31:05" (1/3) ... [2021-10-11 00:31:07,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13734ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:31:07, skipping insertion in model container [2021-10-11 00:31:07,129 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:31:07,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:31:06" (2/3) ... [2021-10-11 00:31:07,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13734ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:31:07, skipping insertion in model container [2021-10-11 00:31:07,130 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:31:07,130 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:31:07" (3/3) ... [2021-10-11 00:31:07,131 INFO L389 chiAutomizerObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-10-11 00:31:07,210 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-11 00:31:07,211 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-11 00:31:07,211 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-11 00:31:07,211 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:31:07,211 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:31:07,211 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-11 00:31:07,211 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:31:07,212 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-11 00:31:07,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2021-10-11 00:31:07,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2021-10-11 00:31:07,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:07,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:07,267 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:07,268 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:07,268 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-11 00:31:07,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2021-10-11 00:31:07,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2021-10-11 00:31:07,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:07,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:07,281 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:07,282 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:07,289 INFO L794 eck$LassoCheckResult]: Stem: 118#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(22);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 14#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 88#L383true havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 39#L155true assume !(1 == ~m_i~0);~m_st~0 := 2; 129#L162-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 136#L167-1true assume !(0 == ~M_E~0); 49#L251-1true assume !(0 == ~T1_E~0); 117#L256-1true assume !(0 == ~E_M~0); 134#L261-1true assume !(0 == ~E_1~0); 138#L266-1true havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 64#L116true assume !(1 == ~m_pc~0); 58#L116-2true is_master_triggered_~__retres1~0 := 0; 90#L127true is_master_triggered_#res := is_master_triggered_~__retres1~0; 35#L128true activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 113#L311true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 116#L311-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 81#L135true assume 1 == ~t1_pc~0; 28#L136true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 83#L146true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 29#L147true activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 126#L319true assume !(0 != activate_threads_~tmp___0~0); 120#L319-2true assume !(1 == ~M_E~0); 44#L279-1true assume !(1 == ~T1_E~0); 51#L284-1true assume !(1 == ~E_M~0); 119#L289-1true assume 1 == ~E_1~0;~E_1~0 := 2; 3#L420-1true [2021-10-11 00:31:07,291 INFO L796 eck$LassoCheckResult]: Loop: 3#L420-1true assume !false; 122#L421true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 103#L226true assume !true; 4#L241true start_simulation_~kernel_st~0 := 2; 37#L155-1true start_simulation_~kernel_st~0 := 3; 71#L251-2true assume 0 == ~M_E~0;~M_E~0 := 1; 68#L251-4true assume 0 == ~T1_E~0;~T1_E~0 := 1; 84#L256-3true assume 0 == ~E_M~0;~E_M~0 := 1; 131#L261-3true assume !(0 == ~E_1~0); 137#L266-3true havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 66#L116-9true assume 1 == ~m_pc~0; 7#L117-3true assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 55#L127-3true is_master_triggered_#res := is_master_triggered_~__retres1~0; 8#L128-3true activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 77#L311-9true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 82#L311-11true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 63#L135-9true assume 1 == ~t1_pc~0; 17#L136-3true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 74#L146-3true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 19#L147-3true activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 115#L319-9true assume !(0 != activate_threads_~tmp___0~0); 92#L319-11true assume 1 == ~M_E~0;~M_E~0 := 2; 32#L279-3true assume 1 == ~T1_E~0;~T1_E~0 := 2; 72#L284-3true assume 1 == ~E_M~0;~E_M~0 := 2; 86#L289-3true assume 1 == ~E_1~0;~E_1~0 := 2; 133#L294-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 30#L180-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 139#L192-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 95#L193-1true start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 23#L439true assume !(0 == start_simulation_~tmp~3); 27#L439-1true 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; 26#L180-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 125#L192-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 94#L193-2true stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 87#L394true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 142#L401true stop_simulation_#res := stop_simulation_~__retres2~0; 100#L402true start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 48#L452true assume !(0 != start_simulation_~tmp___0~1); 3#L420-1true [2021-10-11 00:31:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash 22332154, now seen corresponding path program 1 times [2021-10-11 00:31:07,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:07,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286955760] [2021-10-11 00:31:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:07,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286955760] [2021-10-11 00:31:07,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:07,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:31:07,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419856765] [2021-10-11 00:31:07,549 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:31:07,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2064875915, now seen corresponding path program 1 times [2021-10-11 00:31:07,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:07,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138567507] [2021-10-11 00:31:07,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:07,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138567507] [2021-10-11 00:31:07,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:07,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:31:07,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869741101] [2021-10-11 00:31:07,600 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:31:07,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:07,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:31:07,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:31:07,618 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2021-10-11 00:31:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:07,652 INFO L93 Difference]: Finished difference Result 140 states and 208 transitions. [2021-10-11 00:31:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:31:07,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 208 transitions. [2021-10-11 00:31:07,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2021-10-11 00:31:07,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 135 states and 203 transitions. [2021-10-11 00:31:07,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2021-10-11 00:31:07,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2021-10-11 00:31:07,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 203 transitions. [2021-10-11 00:31:07,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:31:07,673 INFO L692 BuchiCegarLoop]: Abstraction has 135 states and 203 transitions. [2021-10-11 00:31:07,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 203 transitions. [2021-10-11 00:31:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-10-11 00:31:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2021-10-11 00:31:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2021-10-11 00:31:07,711 INFO L715 BuchiCegarLoop]: Abstraction has 135 states and 203 transitions. [2021-10-11 00:31:07,711 INFO L595 BuchiCegarLoop]: Abstraction has 135 states and 203 transitions. [2021-10-11 00:31:07,712 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-11 00:31:07,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 203 transitions. [2021-10-11 00:31:07,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2021-10-11 00:31:07,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:07,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:07,717 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:07,718 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:07,718 INFO L794 eck$LassoCheckResult]: Stem: 417#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(22);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 315#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 316#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 370#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 371#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 421#L167-1 assume !(0 == ~M_E~0); 377#L251-1 assume !(0 == ~T1_E~0); 378#L256-1 assume !(0 == ~E_M~0); 416#L261-1 assume !(0 == ~E_1~0); 423#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 387#L116 assume !(1 == ~m_pc~0); 362#L116-2 is_master_triggered_~__retres1~0 := 0; 361#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 363#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 364#L311 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 415#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 396#L135 assume 1 == ~t1_pc~0; 345#L136 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 346#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 348#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 349#L319 assume !(0 != activate_threads_~tmp___0~0); 418#L319-2 assume !(1 == ~M_E~0); 372#L279-1 assume !(1 == ~T1_E~0); 373#L284-1 assume !(1 == ~E_M~0); 382#L289-1 assume 1 == ~E_1~0;~E_1~0 := 2; 289#L420-1 [2021-10-11 00:31:07,718 INFO L796 eck$LassoCheckResult]: Loop: 289#L420-1 assume !false; 290#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 336#L226 assume !false; 412#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 353#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 354#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 407#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 375#L207 assume !(0 != eval_~tmp~0); 294#L241 start_simulation_~kernel_st~0 := 2; 295#L155-1 start_simulation_~kernel_st~0 := 3; 369#L251-2 assume 0 == ~M_E~0;~M_E~0 := 1; 390#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 391#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 397#L261-3 assume !(0 == ~E_1~0); 422#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 389#L116-9 assume 1 == ~m_pc~0; 298#L117-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 299#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 301#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 302#L311-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 395#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 386#L135-9 assume 1 == ~t1_pc~0; 321#L136-3 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 322#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 326#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 327#L319-9 assume !(0 != activate_threads_~tmp___0~0); 403#L319-11 assume 1 == ~M_E~0;~M_E~0 := 2; 356#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 357#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 394#L289-3 assume 1 == ~E_1~0;~E_1~0 := 2; 398#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 350#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 352#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 404#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 333#L439 assume !(0 == start_simulation_~tmp~3); 318#L439-1 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; 340#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 341#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 401#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 399#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 400#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 406#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 374#L452 assume !(0 != start_simulation_~tmp___0~1); 289#L420-1 [2021-10-11 00:31:07,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:07,719 INFO L82 PathProgramCache]: Analyzing trace with hash -196522564, now seen corresponding path program 1 times [2021-10-11 00:31:07,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:07,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682245092] [2021-10-11 00:31:07,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:07,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682245092] [2021-10-11 00:31:07,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:07,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:31:07,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899699118] [2021-10-11 00:31:07,786 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:31:07,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:07,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1294122548, now seen corresponding path program 1 times [2021-10-11 00:31:07,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:07,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762999782] [2021-10-11 00:31:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:07,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762999782] [2021-10-11 00:31:07,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:07,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:31:07,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250373242] [2021-10-11 00:31:07,874 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:31:07,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:07,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:31:07,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:31:07,880 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. cyclomatic complexity: 69 Second operand 5 states. [2021-10-11 00:31:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:08,125 INFO L93 Difference]: Finished difference Result 340 states and 504 transitions. [2021-10-11 00:31:08,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:31:08,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 504 transitions. [2021-10-11 00:31:08,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 288 [2021-10-11 00:31:08,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 340 states and 504 transitions. [2021-10-11 00:31:08,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2021-10-11 00:31:08,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 340 [2021-10-11 00:31:08,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 504 transitions. [2021-10-11 00:31:08,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:31:08,161 INFO L692 BuchiCegarLoop]: Abstraction has 340 states and 504 transitions. [2021-10-11 00:31:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 504 transitions. [2021-10-11 00:31:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 150. [2021-10-11 00:31:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2021-10-11 00:31:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 218 transitions. [2021-10-11 00:31:08,179 INFO L715 BuchiCegarLoop]: Abstraction has 150 states and 218 transitions. [2021-10-11 00:31:08,179 INFO L595 BuchiCegarLoop]: Abstraction has 150 states and 218 transitions. [2021-10-11 00:31:08,179 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-11 00:31:08,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 218 transitions. [2021-10-11 00:31:08,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 120 [2021-10-11 00:31:08,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:08,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:08,183 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:08,183 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:08,183 INFO L794 eck$LassoCheckResult]: Stem: 922#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(22);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 805#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 806#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 860#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 861#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 926#L167-1 assume !(0 == ~M_E~0); 870#L251-1 assume !(0 == ~T1_E~0); 871#L256-1 assume !(0 == ~E_M~0); 921#L261-1 assume !(0 == ~E_1~0); 928#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 886#L116 assume !(1 == ~m_pc~0); 852#L116-2 is_master_triggered_~__retres1~0 := 0; 879#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 906#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 919#L311 assume !(0 != activate_threads_~tmp~1); 920#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 896#L135 assume 1 == ~t1_pc~0; 835#L136 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 836#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 841#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 842#L319 assume !(0 != activate_threads_~tmp___0~0); 923#L319-2 assume !(1 == ~M_E~0); 864#L279-1 assume !(1 == ~T1_E~0); 865#L284-1 assume !(1 == ~E_M~0); 876#L289-1 assume 1 == ~E_1~0;~E_1~0 := 2; 779#L420-1 [2021-10-11 00:31:08,184 INFO L796 eck$LassoCheckResult]: Loop: 779#L420-1 assume !false; 780#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 824#L226 assume !false; 917#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 845#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 846#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 909#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 866#L207 assume !(0 != eval_~tmp~0); 781#L241 start_simulation_~kernel_st~0 := 2; 782#L155-1 start_simulation_~kernel_st~0 := 3; 858#L251-2 assume 0 == ~M_E~0;~M_E~0 := 1; 889#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 890#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 897#L261-3 assume !(0 == ~E_1~0); 927#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 888#L116-9 assume 1 == ~m_pc~0; 788#L117-3 assume 1 == ~E_M~0;is_master_triggered_~__retres1~0 := 1; 789#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 791#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 792#L311-9 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 895#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 885#L135-9 assume 1 == ~t1_pc~0; 811#L136-3 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 812#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 816#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 817#L319-9 assume !(0 != activate_threads_~tmp___0~0); 904#L319-11 assume 1 == ~M_E~0;~M_E~0 := 2; 843#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 844#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 893#L289-3 assume 1 == ~E_1~0;~E_1~0 := 2; 899#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 838#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 840#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 907#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 825#L439 assume !(0 == start_simulation_~tmp~3); 808#L439-1 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; 832#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 833#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 905#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 900#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 901#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 912#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 869#L452 assume !(0 != start_simulation_~tmp___0~1); 779#L420-1 [2021-10-11 00:31:08,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:08,185 INFO L82 PathProgramCache]: Analyzing trace with hash 504542014, now seen corresponding path program 1 times [2021-10-11 00:31:08,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:08,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088574125] [2021-10-11 00:31:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:08,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088574125] [2021-10-11 00:31:08,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:08,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:31:08,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740513366] [2021-10-11 00:31:08,273 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:31:08,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1294122548, now seen corresponding path program 2 times [2021-10-11 00:31:08,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:08,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685355901] [2021-10-11 00:31:08,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:08,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685355901] [2021-10-11 00:31:08,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:08,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:31:08,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932050608] [2021-10-11 00:31:08,341 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:31:08,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:08,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:31:08,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:31:08,342 INFO L87 Difference]: Start difference. First operand 150 states and 218 transitions. cyclomatic complexity: 69 Second operand 4 states. [2021-10-11 00:31:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:08,480 INFO L93 Difference]: Finished difference Result 335 states and 469 transitions. [2021-10-11 00:31:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:31:08,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 469 transitions. [2021-10-11 00:31:08,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 290 [2021-10-11 00:31:08,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 335 states and 469 transitions. [2021-10-11 00:31:08,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 335 [2021-10-11 00:31:08,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2021-10-11 00:31:08,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 335 states and 469 transitions. [2021-10-11 00:31:08,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:31:08,496 INFO L692 BuchiCegarLoop]: Abstraction has 335 states and 469 transitions. [2021-10-11 00:31:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states and 469 transitions. [2021-10-11 00:31:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 313. [2021-10-11 00:31:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2021-10-11 00:31:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 444 transitions. [2021-10-11 00:31:08,524 INFO L715 BuchiCegarLoop]: Abstraction has 313 states and 444 transitions. [2021-10-11 00:31:08,524 INFO L595 BuchiCegarLoop]: Abstraction has 313 states and 444 transitions. [2021-10-11 00:31:08,524 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-11 00:31:08,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 444 transitions. [2021-10-11 00:31:08,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 283 [2021-10-11 00:31:08,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:08,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:08,530 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:08,530 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:08,531 INFO L794 eck$LassoCheckResult]: Stem: 1422#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(22);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 1302#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1303#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 1352#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 1353#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1427#L167-1 assume !(0 == ~M_E~0); 1365#L251-1 assume !(0 == ~T1_E~0); 1366#L256-1 assume !(0 == ~E_M~0); 1421#L261-1 assume !(0 == ~E_1~0); 1429#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1383#L116 assume !(1 == ~m_pc~0); 1377#L116-2 is_master_triggered_~__retres1~0 := 0; 1378#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1345#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1346#L311 assume !(0 != activate_threads_~tmp~1); 1420#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1398#L135 assume !(1 == ~t1_pc~0); 1395#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 1396#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1336#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1337#L319 assume !(0 != activate_threads_~tmp___0~0); 1424#L319-2 assume !(1 == ~M_E~0); 1358#L279-1 assume !(1 == ~T1_E~0); 1359#L284-1 assume !(1 == ~E_M~0); 1372#L289-1 assume 1 == ~E_1~0;~E_1~0 := 2; 1423#L420-1 [2021-10-11 00:31:08,531 INFO L796 eck$LassoCheckResult]: Loop: 1423#L420-1 assume !false; 1556#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1414#L226 assume !false; 1415#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1340#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1341#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1409#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 1361#L207 assume !(0 != eval_~tmp~0); 1363#L241 start_simulation_~kernel_st~0 := 2; 1563#L155-1 start_simulation_~kernel_st~0 := 3; 1562#L251-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1561#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 1399#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 1400#L261-3 assume !(0 == ~E_1~0); 1428#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 1385#L116-9 assume !(1 == ~m_pc~0); 1356#L116-11 is_master_triggered_~__retres1~0 := 0; 1357#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1564#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1393#L311-9 assume !(0 != activate_threads_~tmp~1); 1394#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1382#L135-9 assume !(1 == ~t1_pc~0); 1374#L135-11 is_transmit1_triggered_~__retres1~1 := 0; 1375#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1313#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 1314#L319-9 assume !(0 != activate_threads_~tmp___0~0); 1404#L319-11 assume 1 == ~M_E~0;~M_E~0 := 2; 1338#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1339#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 1391#L289-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1401#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1333#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1335#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1407#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 1322#L439 assume !(0 == start_simulation_~tmp~3); 1323#L439-1 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; 1575#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1573#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1571#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 1569#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1567#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 1566#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 1559#L452 assume !(0 != start_simulation_~tmp___0~1); 1423#L420-1 [2021-10-11 00:31:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:08,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777217, now seen corresponding path program 1 times [2021-10-11 00:31:08,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:08,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957309376] [2021-10-11 00:31:08,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:08,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957309376] [2021-10-11 00:31:08,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:08,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:31:08,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891569761] [2021-10-11 00:31:08,621 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:31:08,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:08,622 INFO L82 PathProgramCache]: Analyzing trace with hash 738283376, now seen corresponding path program 1 times [2021-10-11 00:31:08,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:08,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273383293] [2021-10-11 00:31:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:08,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273383293] [2021-10-11 00:31:08,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:08,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:31:08,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316064948] [2021-10-11 00:31:08,704 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:31:08,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:08,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:31:08,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:31:08,722 INFO L87 Difference]: Start difference. First operand 313 states and 444 transitions. cyclomatic complexity: 133 Second operand 4 states. [2021-10-11 00:31:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:08,838 INFO L93 Difference]: Finished difference Result 605 states and 841 transitions. [2021-10-11 00:31:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:31:08,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 605 states and 841 transitions. [2021-10-11 00:31:08,845 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 526 [2021-10-11 00:31:08,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 605 states to 605 states and 841 transitions. [2021-10-11 00:31:08,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 605 [2021-10-11 00:31:08,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 605 [2021-10-11 00:31:08,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 605 states and 841 transitions. [2021-10-11 00:31:08,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:31:08,853 INFO L692 BuchiCegarLoop]: Abstraction has 605 states and 841 transitions. [2021-10-11 00:31:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states and 841 transitions. [2021-10-11 00:31:08,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 587. [2021-10-11 00:31:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2021-10-11 00:31:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 817 transitions. [2021-10-11 00:31:08,889 INFO L715 BuchiCegarLoop]: Abstraction has 587 states and 817 transitions. [2021-10-11 00:31:08,889 INFO L595 BuchiCegarLoop]: Abstraction has 587 states and 817 transitions. [2021-10-11 00:31:08,889 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-11 00:31:08,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 587 states and 817 transitions. [2021-10-11 00:31:08,895 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 522 [2021-10-11 00:31:08,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:08,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:08,900 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:08,900 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:08,900 INFO L794 eck$LassoCheckResult]: Stem: 2366#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(22);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 2232#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2233#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 2280#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 2281#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2373#L167-1 assume 0 == ~M_E~0;~M_E~0 := 1; 2291#L251-1 assume !(0 == ~T1_E~0); 2292#L256-1 assume !(0 == ~E_M~0); 2545#L261-1 assume 0 == ~E_1~0;~E_1~0 := 1; 2376#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2505#L116 assume !(1 == ~m_pc~0); 2504#L116-2 is_master_triggered_~__retres1~0 := 0; 2503#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2502#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2501#L311 assume !(0 != activate_threads_~tmp~1); 2500#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2499#L135 assume !(1 == ~t1_pc~0); 2498#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 2497#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2496#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2495#L319 assume !(0 != activate_threads_~tmp___0~0); 2494#L319-2 assume !(1 == ~M_E~0); 2493#L279-1 assume !(1 == ~T1_E~0); 2492#L284-1 assume !(1 == ~E_M~0); 2490#L289-1 assume 1 == ~E_1~0;~E_1~0 := 2; 2491#L420-1 [2021-10-11 00:31:08,902 INFO L796 eck$LassoCheckResult]: Loop: 2491#L420-1 assume !false; 2726#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2715#L226 assume !false; 2725#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2724#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2722#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2721#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 2719#L207 assume !(0 != eval_~tmp~0); 2720#L241 start_simulation_~kernel_st~0 := 2; 2777#L155-1 start_simulation_~kernel_st~0 := 3; 2775#L251-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2322#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 2774#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 2773#L261-3 assume !(0 == ~E_1~0); 2772#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 2770#L116-9 assume !(1 == ~m_pc~0); 2768#L116-11 is_master_triggered_~__retres1~0 := 0; 2766#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2764#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2762#L311-9 assume !(0 != activate_threads_~tmp~1); 2760#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2758#L135-9 assume !(1 == ~t1_pc~0); 2756#L135-11 is_transmit1_triggered_~__retres1~1 := 0; 2754#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2752#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 2750#L319-9 assume !(0 != activate_threads_~tmp___0~0); 2748#L319-11 assume 1 == ~M_E~0;~M_E~0 := 2; 2746#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2744#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 2743#L289-3 assume !(1 == ~E_1~0); 2741#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2740#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2738#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2737#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 2736#L439 assume !(0 == start_simulation_~tmp~3); 2486#L439-1 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; 2735#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2733#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2732#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 2731#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2730#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 2729#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 2728#L452 assume !(0 != start_simulation_~tmp___0~1); 2491#L420-1 [2021-10-11 00:31:08,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:08,904 INFO L82 PathProgramCache]: Analyzing trace with hash 715219135, now seen corresponding path program 1 times [2021-10-11 00:31:08,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:08,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360061317] [2021-10-11 00:31:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:08,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360061317] [2021-10-11 00:31:08,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:08,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:31:08,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089415189] [2021-10-11 00:31:08,954 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:31:08,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:08,954 INFO L82 PathProgramCache]: Analyzing trace with hash -272833874, now seen corresponding path program 1 times [2021-10-11 00:31:08,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:08,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439912924] [2021-10-11 00:31:08,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:09,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439912924] [2021-10-11 00:31:09,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:09,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:31:09,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899806327] [2021-10-11 00:31:09,012 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:31:09,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:09,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:31:09,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:31:09,015 INFO L87 Difference]: Start difference. First operand 587 states and 817 transitions. cyclomatic complexity: 234 Second operand 3 states. [2021-10-11 00:31:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:09,039 INFO L93 Difference]: Finished difference Result 864 states and 1195 transitions. [2021-10-11 00:31:09,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:31:09,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 864 states and 1195 transitions. [2021-10-11 00:31:09,048 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 813 [2021-10-11 00:31:09,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 864 states to 864 states and 1195 transitions. [2021-10-11 00:31:09,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 864 [2021-10-11 00:31:09,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 864 [2021-10-11 00:31:09,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 864 states and 1195 transitions. [2021-10-11 00:31:09,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:31:09,061 INFO L692 BuchiCegarLoop]: Abstraction has 864 states and 1195 transitions. [2021-10-11 00:31:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states and 1195 transitions. [2021-10-11 00:31:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 681. [2021-10-11 00:31:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2021-10-11 00:31:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 940 transitions. [2021-10-11 00:31:09,078 INFO L715 BuchiCegarLoop]: Abstraction has 681 states and 940 transitions. [2021-10-11 00:31:09,078 INFO L595 BuchiCegarLoop]: Abstraction has 681 states and 940 transitions. [2021-10-11 00:31:09,078 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-11 00:31:09,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 681 states and 940 transitions. [2021-10-11 00:31:09,083 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 630 [2021-10-11 00:31:09,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:09,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:09,085 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:09,085 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:09,086 INFO L794 eck$LassoCheckResult]: Stem: 3822#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(22);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 3692#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 3693#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 3739#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 3740#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 3829#L167-1 assume !(0 == ~M_E~0); 3750#L251-1 assume !(0 == ~T1_E~0); 3751#L256-1 assume !(0 == ~E_M~0); 3821#L261-1 assume 0 == ~E_1~0;~E_1~0 := 1; 3833#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 4032#L116 assume !(1 == ~m_pc~0); 4031#L116-2 is_master_triggered_~__retres1~0 := 0; 4030#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 4029#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 4028#L311 assume !(0 != activate_threads_~tmp~1); 4027#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 4026#L135 assume !(1 == ~t1_pc~0); 4025#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 4024#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 4023#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 4022#L319 assume !(0 != activate_threads_~tmp___0~0); 4021#L319-2 assume !(1 == ~M_E~0); 4020#L279-1 assume !(1 == ~T1_E~0); 4019#L284-1 assume !(1 == ~E_M~0); 4018#L289-1 assume 1 == ~E_1~0;~E_1~0 := 2; 3823#L420-1 [2021-10-11 00:31:09,093 INFO L796 eck$LassoCheckResult]: Loop: 3823#L420-1 assume !false; 4016#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 4014#L226 assume !false; 4013#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4011#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 4009#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4006#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 4004#L207 assume !(0 != eval_~tmp~0); 4002#L241 start_simulation_~kernel_st~0 := 2; 4000#L155-1 start_simulation_~kernel_st~0 := 3; 3999#L251-2 assume !(0 == ~M_E~0); 3998#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 3997#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 3994#L261-3 assume 0 == ~E_1~0;~E_1~0 := 1; 3993#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 3992#L116-9 assume !(1 == ~m_pc~0); 3991#L116-11 is_master_triggered_~__retres1~0 := 0; 3990#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3989#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3988#L311-9 assume !(0 != activate_threads_~tmp~1); 3987#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3986#L135-9 assume !(1 == ~t1_pc~0); 3985#L135-11 is_transmit1_triggered_~__retres1~1 := 0; 3984#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3983#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 3982#L319-9 assume !(0 != activate_threads_~tmp___0~0); 3981#L319-11 assume !(1 == ~M_E~0); 3964#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 3980#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 3891#L289-3 assume 1 == ~E_1~0;~E_1~0 := 2; 3889#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3887#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 3884#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3882#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 3710#L439 assume !(0 == start_simulation_~tmp~3); 3711#L439-1 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; 4039#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 4037#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4036#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 4035#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 4034#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 4033#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 4017#L452 assume !(0 != start_simulation_~tmp___0~1); 3823#L420-1 [2021-10-11 00:31:09,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:09,094 INFO L82 PathProgramCache]: Analyzing trace with hash -102429315, now seen corresponding path program 1 times [2021-10-11 00:31:09,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:09,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894622478] [2021-10-11 00:31:09,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:09,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894622478] [2021-10-11 00:31:09,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:09,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:31:09,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536016798] [2021-10-11 00:31:09,141 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:31:09,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:09,141 INFO L82 PathProgramCache]: Analyzing trace with hash -945083338, now seen corresponding path program 1 times [2021-10-11 00:31:09,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:09,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317125093] [2021-10-11 00:31:09,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:09,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317125093] [2021-10-11 00:31:09,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:09,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:31:09,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685496782] [2021-10-11 00:31:09,204 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:31:09,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:09,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:31:09,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:31:09,205 INFO L87 Difference]: Start difference. First operand 681 states and 940 transitions. cyclomatic complexity: 261 Second operand 4 states. [2021-10-11 00:31:09,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:09,278 INFO L93 Difference]: Finished difference Result 750 states and 1029 transitions. [2021-10-11 00:31:09,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:31:09,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 750 states and 1029 transitions. [2021-10-11 00:31:09,286 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 701 [2021-10-11 00:31:09,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 750 states to 750 states and 1029 transitions. [2021-10-11 00:31:09,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 750 [2021-10-11 00:31:09,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 750 [2021-10-11 00:31:09,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 750 states and 1029 transitions. [2021-10-11 00:31:09,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:31:09,295 INFO L692 BuchiCegarLoop]: Abstraction has 750 states and 1029 transitions. [2021-10-11 00:31:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states and 1029 transitions. [2021-10-11 00:31:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 553. [2021-10-11 00:31:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2021-10-11 00:31:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 758 transitions. [2021-10-11 00:31:09,308 INFO L715 BuchiCegarLoop]: Abstraction has 553 states and 758 transitions. [2021-10-11 00:31:09,308 INFO L595 BuchiCegarLoop]: Abstraction has 553 states and 758 transitions. [2021-10-11 00:31:09,309 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-11 00:31:09,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 553 states and 758 transitions. [2021-10-11 00:31:09,312 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 518 [2021-10-11 00:31:09,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:09,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:09,314 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:09,314 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:09,314 INFO L794 eck$LassoCheckResult]: Stem: 5267#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(22);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 5135#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 5136#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 5183#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 5184#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5275#L167-1 assume !(0 == ~M_E~0); 5196#L251-1 assume !(0 == ~T1_E~0); 5197#L256-1 assume !(0 == ~E_M~0); 5266#L261-1 assume !(0 == ~E_1~0); 5278#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 5216#L116 assume !(1 == ~m_pc~0); 5209#L116-2 is_master_triggered_~__retres1~0 := 0; 5210#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5177#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5178#L311 assume !(0 != activate_threads_~tmp~1); 5265#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5233#L135 assume !(1 == ~t1_pc~0); 5227#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 5228#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5165#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5166#L319 assume !(0 != activate_threads_~tmp___0~0); 5269#L319-2 assume !(1 == ~M_E~0); 5188#L279-1 assume !(1 == ~T1_E~0); 5189#L284-1 assume !(1 == ~E_M~0); 5201#L289-1 assume !(1 == ~E_1~0); 5268#L420-1 [2021-10-11 00:31:09,314 INFO L796 eck$LassoCheckResult]: Loop: 5268#L420-1 assume !false; 5579#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 5576#L226 assume !false; 5573#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5570#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5566#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5564#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 5544#L207 assume !(0 != eval_~tmp~0); 5545#L241 start_simulation_~kernel_st~0 := 2; 5659#L155-1 start_simulation_~kernel_st~0 := 3; 5658#L251-2 assume !(0 == ~M_E~0); 5656#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 5654#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 5652#L261-3 assume !(0 == ~E_1~0); 5637#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 5636#L116-9 assume !(1 == ~m_pc~0); 5635#L116-11 is_master_triggered_~__retres1~0 := 0; 5634#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5633#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5632#L311-9 assume !(0 != activate_threads_~tmp~1); 5631#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5629#L135-9 assume !(1 == ~t1_pc~0); 5627#L135-11 is_transmit1_triggered_~__retres1~1 := 0; 5626#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5145#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 5146#L319-9 assume !(0 != activate_threads_~tmp___0~0); 5241#L319-11 assume !(1 == ~M_E~0); 5173#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 5174#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 5224#L289-3 assume !(1 == ~E_1~0); 5237#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5277#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5309#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5307#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 5153#L439 assume !(0 == start_simulation_~tmp~3); 5154#L439-1 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; 5161#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5162#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5272#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 5238#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5239#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 5251#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 5252#L452 assume !(0 != start_simulation_~tmp___0~1); 5268#L420-1 [2021-10-11 00:31:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:09,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 1 times [2021-10-11 00:31:09,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:09,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400428269] [2021-10-11 00:31:09,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:09,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:09,343 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:09,374 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:31:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:09,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1933568334, now seen corresponding path program 1 times [2021-10-11 00:31:09,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:09,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231323244] [2021-10-11 00:31:09,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:09,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231323244] [2021-10-11 00:31:09,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:09,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:31:09,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805646241] [2021-10-11 00:31:09,415 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:31:09,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:09,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:31:09,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:31:09,416 INFO L87 Difference]: Start difference. First operand 553 states and 758 transitions. cyclomatic complexity: 207 Second operand 5 states. [2021-10-11 00:31:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:09,522 INFO L93 Difference]: Finished difference Result 937 states and 1261 transitions. [2021-10-11 00:31:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:31:09,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 937 states and 1261 transitions. [2021-10-11 00:31:09,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 892 [2021-10-11 00:31:09,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 937 states to 937 states and 1261 transitions. [2021-10-11 00:31:09,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 937 [2021-10-11 00:31:09,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 937 [2021-10-11 00:31:09,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 937 states and 1261 transitions. [2021-10-11 00:31:09,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:31:09,542 INFO L692 BuchiCegarLoop]: Abstraction has 937 states and 1261 transitions. [2021-10-11 00:31:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states and 1261 transitions. [2021-10-11 00:31:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 571. [2021-10-11 00:31:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2021-10-11 00:31:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 776 transitions. [2021-10-11 00:31:09,557 INFO L715 BuchiCegarLoop]: Abstraction has 571 states and 776 transitions. [2021-10-11 00:31:09,557 INFO L595 BuchiCegarLoop]: Abstraction has 571 states and 776 transitions. [2021-10-11 00:31:09,557 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-11 00:31:09,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 571 states and 776 transitions. [2021-10-11 00:31:09,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 536 [2021-10-11 00:31:09,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:09,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:09,562 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:09,562 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:09,562 INFO L794 eck$LassoCheckResult]: Stem: 6776#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(22);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 6641#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 6642#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 6689#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 6690#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 6783#L167-1 assume !(0 == ~M_E~0); 6701#L251-1 assume !(0 == ~T1_E~0); 6702#L256-1 assume !(0 == ~E_M~0); 6775#L261-1 assume !(0 == ~E_1~0); 6789#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 6722#L116 assume !(1 == ~m_pc~0); 6715#L116-2 is_master_triggered_~__retres1~0 := 0; 6716#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6682#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 6683#L311 assume !(0 != activate_threads_~tmp~1); 6772#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6746#L135 assume !(1 == ~t1_pc~0); 6739#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 6740#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 6673#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 6674#L319 assume !(0 != activate_threads_~tmp___0~0); 6778#L319-2 assume !(1 == ~M_E~0); 6695#L279-1 assume !(1 == ~T1_E~0); 6696#L284-1 assume !(1 == ~E_M~0); 6708#L289-1 assume !(1 == ~E_1~0); 6777#L420-1 [2021-10-11 00:31:09,562 INFO L796 eck$LassoCheckResult]: Loop: 6777#L420-1 assume !false; 7140#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 7112#L226 assume !false; 6793#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6675#L180 assume !(0 == ~m_st~0); 6677#L184 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 6786#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7110#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 7108#L207 assume !(0 != eval_~tmp~0); 6617#L241 start_simulation_~kernel_st~0 := 2; 6618#L155-1 start_simulation_~kernel_st~0 := 3; 6731#L251-2 assume !(0 == ~M_E~0); 6732#L251-4 assume 0 == ~T1_E~0;~T1_E~0 := 1; 6747#L256-3 assume 0 == ~E_M~0;~E_M~0 := 1; 6748#L261-3 assume !(0 == ~E_1~0); 6790#L266-3 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 6791#L116-9 assume !(1 == ~m_pc~0); 6693#L116-11 is_master_triggered_~__retres1~0 := 0; 6694#L127-3 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6627#L128-3 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 6628#L311-9 assume !(0 != activate_threads_~tmp~1); 6744#L311-11 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6745#L135-9 assume !(1 == ~t1_pc~0); 6711#L135-11 is_transmit1_triggered_~__retres1~1 := 0; 6712#L146-3 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 6651#L147-3 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 6652#L319-9 assume !(0 != activate_threads_~tmp___0~0); 6755#L319-11 assume !(1 == ~M_E~0); 6756#L279-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 6733#L284-3 assume 1 == ~E_M~0;~E_M~0 := 2; 6734#L289-3 assume !(1 == ~E_1~0); 6787#L294-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 6788#L180-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 7166#L192-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7165#L193-1 start_simulation_#t~ret14 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 7164#L439 assume !(0 == start_simulation_~tmp~3); 7162#L439-1 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; 6664#L180-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 6665#L192-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 6781#L193-2 stop_simulation_#t~ret13 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret13;havoc stop_simulation_#t~ret13; 7148#L394 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 7143#L401 stop_simulation_#res := stop_simulation_~__retres2~0; 7142#L402 start_simulation_#t~ret15 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret15;havoc start_simulation_#t~ret15; 7141#L452 assume !(0 != start_simulation_~tmp___0~1); 6777#L420-1 [2021-10-11 00:31:09,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1690777215, now seen corresponding path program 2 times [2021-10-11 00:31:09,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:09,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939578275] [2021-10-11 00:31:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:09,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:09,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:09,583 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:31:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:09,584 INFO L82 PathProgramCache]: Analyzing trace with hash 669385365, now seen corresponding path program 1 times [2021-10-11 00:31:09,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:09,584 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60845164] [2021-10-11 00:31:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:09,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60845164] [2021-10-11 00:31:09,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:09,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:31:09,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325260679] [2021-10-11 00:31:09,605 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:31:09,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:09,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:31:09,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:31:09,606 INFO L87 Difference]: Start difference. First operand 571 states and 776 transitions. cyclomatic complexity: 207 Second operand 3 states. [2021-10-11 00:31:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:09,655 INFO L93 Difference]: Finished difference Result 839 states and 1113 transitions. [2021-10-11 00:31:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:31:09,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 839 states and 1113 transitions. [2021-10-11 00:31:09,662 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 807 [2021-10-11 00:31:09,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 839 states to 839 states and 1113 transitions. [2021-10-11 00:31:09,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 839 [2021-10-11 00:31:09,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 839 [2021-10-11 00:31:09,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 839 states and 1113 transitions. [2021-10-11 00:31:09,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:31:09,671 INFO L692 BuchiCegarLoop]: Abstraction has 839 states and 1113 transitions. [2021-10-11 00:31:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states and 1113 transitions. [2021-10-11 00:31:09,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 809. [2021-10-11 00:31:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2021-10-11 00:31:09,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1075 transitions. [2021-10-11 00:31:09,688 INFO L715 BuchiCegarLoop]: Abstraction has 809 states and 1075 transitions. [2021-10-11 00:31:09,688 INFO L595 BuchiCegarLoop]: Abstraction has 809 states and 1075 transitions. [2021-10-11 00:31:09,688 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-11 00:31:09,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 809 states and 1075 transitions. [2021-10-11 00:31:09,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 777 [2021-10-11 00:31:09,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:09,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:09,694 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:09,694 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:09,694 INFO L794 eck$LassoCheckResult]: Stem: 8188#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(22);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 8057#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 8058#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 8103#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 8104#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 8199#L167-1 assume !(0 == ~M_E~0); 8116#L251-1 assume !(0 == ~T1_E~0); 8117#L256-1 assume !(0 == ~E_M~0); 8187#L261-1 assume !(0 == ~E_1~0); 8206#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 8138#L116 assume !(1 == ~m_pc~0); 8131#L116-2 is_master_triggered_~__retres1~0 := 0; 8132#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 8096#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 8097#L311 assume !(0 != activate_threads_~tmp~1); 8186#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 8154#L135 assume !(1 == ~t1_pc~0); 8149#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 8150#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8086#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 8087#L319 assume !(0 != activate_threads_~tmp___0~0); 8190#L319-2 assume !(1 == ~M_E~0); 8109#L279-1 assume !(1 == ~T1_E~0); 8110#L284-1 assume !(1 == ~E_M~0); 8121#L289-1 assume !(1 == ~E_1~0); 8189#L420-1 assume !false; 8673#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 8120#L226 [2021-10-11 00:31:09,694 INFO L796 eck$LassoCheckResult]: Loop: 8120#L226 assume !false; 8670#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 8667#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8665#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 8663#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 8661#L207 assume 0 != eval_~tmp~0; 8657#L207-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 8175#L215 assume !(0 != eval_~tmp_ndt_1~0); 8160#L212 assume !(0 == ~t1_st~0); 8120#L226 [2021-10-11 00:31:09,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:09,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1339261757, now seen corresponding path program 1 times [2021-10-11 00:31:09,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:09,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032346042] [2021-10-11 00:31:09,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:09,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:09,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:09,744 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:31:09,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:09,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1331441589, now seen corresponding path program 1 times [2021-10-11 00:31:09,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:09,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994573819] [2021-10-11 00:31:09,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:09,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:09,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:09,761 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:31:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash 610962889, now seen corresponding path program 1 times [2021-10-11 00:31:09,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:09,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792860880] [2021-10-11 00:31:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:09,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792860880] [2021-10-11 00:31:09,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:09,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:31:09,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297899295] [2021-10-11 00:31:09,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:09,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:31:09,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:31:09,848 INFO L87 Difference]: Start difference. First operand 809 states and 1075 transitions. cyclomatic complexity: 269 Second operand 3 states. [2021-10-11 00:31:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:09,917 INFO L93 Difference]: Finished difference Result 1330 states and 1742 transitions. [2021-10-11 00:31:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:31:09,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 1742 transitions. [2021-10-11 00:31:09,941 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1210 [2021-10-11 00:31:09,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 1742 transitions. [2021-10-11 00:31:09,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2021-10-11 00:31:09,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2021-10-11 00:31:09,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 1742 transitions. [2021-10-11 00:31:09,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:31:09,982 INFO L692 BuchiCegarLoop]: Abstraction has 1330 states and 1742 transitions. [2021-10-11 00:31:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 1742 transitions. [2021-10-11 00:31:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1259. [2021-10-11 00:31:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1259 states. [2021-10-11 00:31:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1661 transitions. [2021-10-11 00:31:10,025 INFO L715 BuchiCegarLoop]: Abstraction has 1259 states and 1661 transitions. [2021-10-11 00:31:10,025 INFO L595 BuchiCegarLoop]: Abstraction has 1259 states and 1661 transitions. [2021-10-11 00:31:10,025 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-11 00:31:10,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1259 states and 1661 transitions. [2021-10-11 00:31:10,032 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1178 [2021-10-11 00:31:10,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:10,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:10,047 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:10,047 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:10,048 INFO L794 eck$LassoCheckResult]: Stem: 10339#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(22);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 10204#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 10205#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 10249#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 10250#L162-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 10349#L167-1 assume !(0 == ~M_E~0); 10359#L251-1 assume !(0 == ~T1_E~0); 10337#L256-1 assume !(0 == ~E_M~0); 10338#L261-1 assume !(0 == ~E_1~0); 10361#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 10362#L116 assume !(1 == ~m_pc~0); 10273#L116-2 is_master_triggered_~__retres1~0 := 0; 10274#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 10241#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 10242#L311 assume !(0 != activate_threads_~tmp~1); 10335#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 10336#L135 assume !(1 == ~t1_pc~0); 10293#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 10294#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 10231#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 10232#L319 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 10347#L319-2 assume !(1 == ~M_E~0); 10255#L279-1 assume !(1 == ~T1_E~0); 10256#L284-1 assume !(1 == ~E_M~0); 10340#L289-1 assume !(1 == ~E_1~0); 10341#L420-1 assume !false; 11250#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 11247#L226 [2021-10-11 00:31:10,048 INFO L796 eck$LassoCheckResult]: Loop: 11247#L226 assume !false; 11245#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11242#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 11238#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11234#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 11231#L207 assume 0 != eval_~tmp~0; 11230#L207-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 11229#L215 assume !(0 != eval_~tmp_ndt_1~0); 11069#L212 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 10441#L229 assume !(0 != eval_~tmp_ndt_2~0); 11247#L226 [2021-10-11 00:31:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:10,048 INFO L82 PathProgramCache]: Analyzing trace with hash -624740157, now seen corresponding path program 1 times [2021-10-11 00:31:10,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:10,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587758096] [2021-10-11 00:31:10,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:31:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:31:10,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587758096] [2021-10-11 00:31:10,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:31:10,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:31:10,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740191498] [2021-10-11 00:31:10,077 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:31:10,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:10,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1674981463, now seen corresponding path program 1 times [2021-10-11 00:31:10,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:10,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239601284] [2021-10-11 00:31:10,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:10,081 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:10,083 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:10,084 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:31:10,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:31:10,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:31:10,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:31:10,146 INFO L87 Difference]: Start difference. First operand 1259 states and 1661 transitions. cyclomatic complexity: 406 Second operand 3 states. [2021-10-11 00:31:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:31:10,156 INFO L93 Difference]: Finished difference Result 1086 states and 1438 transitions. [2021-10-11 00:31:10,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:31:10,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1086 states and 1438 transitions. [2021-10-11 00:31:10,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1054 [2021-10-11 00:31:10,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1086 states to 1086 states and 1438 transitions. [2021-10-11 00:31:10,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1086 [2021-10-11 00:31:10,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1086 [2021-10-11 00:31:10,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1086 states and 1438 transitions. [2021-10-11 00:31:10,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:31:10,175 INFO L692 BuchiCegarLoop]: Abstraction has 1086 states and 1438 transitions. [2021-10-11 00:31:10,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states and 1438 transitions. [2021-10-11 00:31:10,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1086. [2021-10-11 00:31:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2021-10-11 00:31:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1438 transitions. [2021-10-11 00:31:10,198 INFO L715 BuchiCegarLoop]: Abstraction has 1086 states and 1438 transitions. [2021-10-11 00:31:10,198 INFO L595 BuchiCegarLoop]: Abstraction has 1086 states and 1438 transitions. [2021-10-11 00:31:10,198 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-11 00:31:10,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1086 states and 1438 transitions. [2021-10-11 00:31:10,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1054 [2021-10-11 00:31:10,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:31:10,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:31:10,204 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:10,204 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:31:10,205 INFO L794 eck$LassoCheckResult]: Stem: 12685#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(22);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~m_pc~0 := 0;~t1_pc~0 := 0;~m_st~0 := 0;~t1_st~0 := 0;~m_i~0 := 0;~t1_i~0 := 0;~M_E~0 := 2;~T1_E~0 := 2;~E_M~0 := 2;~E_1~0 := 2;~token~0 := 0;~local~0 := 0; 12555#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 12556#L383 havoc start_simulation_#t~ret14, start_simulation_#t~ret15, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~1;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~1;start_simulation_~kernel_st~0 := 0; 12599#L155 assume 1 == ~m_i~0;~m_st~0 := 0; 12600#L162-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 12691#L167-1 assume !(0 == ~M_E~0); 12611#L251-1 assume !(0 == ~T1_E~0); 12612#L256-1 assume !(0 == ~E_M~0); 12684#L261-1 assume !(0 == ~E_1~0); 12696#L266-1 havoc activate_threads_#t~ret11, activate_threads_#t~ret12, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 12632#L116 assume !(1 == ~m_pc~0); 12624#L116-2 is_master_triggered_~__retres1~0 := 0; 12625#L127 is_master_triggered_#res := is_master_triggered_~__retres1~0; 12593#L128 activate_threads_#t~ret11 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 12594#L311 assume !(0 != activate_threads_~tmp~1); 12681#L311-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 12648#L135 assume !(1 == ~t1_pc~0); 12644#L135-2 is_transmit1_triggered_~__retres1~1 := 0; 12645#L146 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 12585#L147 activate_threads_#t~ret12 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret12;havoc activate_threads_#t~ret12; 12586#L319 assume !(0 != activate_threads_~tmp___0~0); 12687#L319-2 assume !(1 == ~M_E~0); 12604#L279-1 assume !(1 == ~T1_E~0); 12605#L284-1 assume !(1 == ~E_M~0); 12616#L289-1 assume !(1 == ~E_1~0); 12686#L420-1 assume !false; 13307#L421 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret8, eval_#t~nondet9, eval_~tmp_ndt_1~0, eval_#t~nondet10, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 12615#L226 [2021-10-11 00:31:10,205 INFO L796 eck$LassoCheckResult]: Loop: 12615#L226 assume !false; 13304#L203 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13302#L180 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 13300#L192 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13297#L193 eval_#t~ret8 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret8;havoc eval_#t~ret8; 13291#L207 assume 0 != eval_~tmp~0; 13288#L207-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 12669#L215 assume !(0 != eval_~tmp_ndt_1~0); 12654#L212 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 12613#L229 assume !(0 != eval_~tmp_ndt_2~0); 12615#L226 [2021-10-11 00:31:10,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:10,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1339261757, now seen corresponding path program 2 times [2021-10-11 00:31:10,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:10,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462382402] [2021-10-11 00:31:10,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:10,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:10,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:10,233 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:31:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1674981463, now seen corresponding path program 2 times [2021-10-11 00:31:10,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:10,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698595879] [2021-10-11 00:31:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:10,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:10,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:10,271 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:31:10,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:31:10,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1759978137, now seen corresponding path program 1 times [2021-10-11 00:31:10,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:31:10,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076192220] [2021-10-11 00:31:10,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:31:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:10,283 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:31:10,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:31:10,304 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:31:10,960 WARN L197 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 99 [2021-10-11 00:31:11,187 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-10-11 00:31:11,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 11.10 12:31:11 BoogieIcfgContainer [2021-10-11 00:31:11,236 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-11 00:31:11,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:31:11,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:31:11,237 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:31:11,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:31:07" (3/4) ... [2021-10-11 00:31:11,240 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-10-11 00:31:11,306 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2d11df4-71ea-437d-a0af-0895eb951782/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:31:11,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:31:11,308 INFO L168 Benchmark]: Toolchain (without parser) took 5319.20 ms. Allocated memory was 113.2 MB in the beginning and 163.6 MB in the end (delta: 50.3 MB). Free memory was 76.3 MB in the beginning and 98.2 MB in the end (delta: -21.9 MB). Peak memory consumption was 28.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:11,308 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 113.2 MB. Free memory is still 93.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:31:11,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.45 ms. Allocated memory is still 113.2 MB. Free memory was 76.2 MB in the beginning and 85.5 MB in the end (delta: -9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:11,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.52 ms. Allocated memory is still 113.2 MB. Free memory was 85.5 MB in the beginning and 83.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:11,310 INFO L168 Benchmark]: Boogie Preprocessor took 84.58 ms. Allocated memory is still 113.2 MB. Free memory was 83.0 MB in the beginning and 81.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:11,310 INFO L168 Benchmark]: RCFGBuilder took 599.86 ms. Allocated memory is still 113.2 MB. Free memory was 80.9 MB in the beginning and 44.0 MB in the end (delta: 36.9 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:11,311 INFO L168 Benchmark]: BuchiAutomizer took 4139.33 ms. Allocated memory was 113.2 MB in the beginning and 163.6 MB in the end (delta: 50.3 MB). Free memory was 44.0 MB in the beginning and 100.3 MB in the end (delta: -56.3 MB). Peak memory consumption was 41.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:11,311 INFO L168 Benchmark]: Witness Printer took 70.14 ms. Allocated memory is still 163.6 MB. Free memory was 100.3 MB in the beginning and 98.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:31:11,313 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.26 ms. Allocated memory is still 113.2 MB. Free memory is still 93.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 337.45 ms. Allocated memory is still 113.2 MB. Free memory was 76.2 MB in the beginning and 85.5 MB in the end (delta: -9.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.52 ms. Allocated memory is still 113.2 MB. Free memory was 85.5 MB in the beginning and 83.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 84.58 ms. Allocated memory is still 113.2 MB. Free memory was 83.0 MB in the beginning and 81.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 599.86 ms. Allocated memory is still 113.2 MB. Free memory was 80.9 MB in the beginning and 44.0 MB in the end (delta: 36.9 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 4139.33 ms. Allocated memory was 113.2 MB in the beginning and 163.6 MB in the end (delta: 50.3 MB). Free memory was 44.0 MB in the beginning and 100.3 MB in the end (delta: -56.3 MB). Peak memory consumption was 41.2 MB. Max. memory is 16.1 GB. * Witness Printer took 70.14 ms. Allocated memory is still 163.6 MB. Free memory was 100.3 MB in the beginning and 98.2 MB in the end (delta: 2.1 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 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1086 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.4s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 1077 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1259 states and ocurred in iteration 9. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2202 SDtfs, 2670 SDslu, 2407 SDs, 0 SdLazy, 314 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN1 SILU0 SILI6 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: 202]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1427} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6f575099=0, NULL=1430, NULL=0, \result=0, token=0, __retres1=0, NULL=1427, tmp=1, \result=0, kernel_st=1, __retres1=0, tmp___0=0, t1_pc=0, __retres1=1, T1_E=2, NULL=1429, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d4a2d2d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d3cada0=0, \result=0, E_1=2, NULL=0, tmp_ndt_1=0, NULL=0, NULL=0, M_E=2, tmp_ndt_2=0, tmp=0, NULL=1428, m_i=1, t1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7fd54490=0, local=0, m_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@39d97fe2=0, E_M=2, NULL=0, tmp___0=0, tmp=0, __retres1=0, t1_i=1, m_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@11110a00=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@65141c8f=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 202]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] int local ; [L465] int __retres1 ; [L380] m_i = 1 [L381] t1_i = 1 [L406] int kernel_st ; [L407] int tmp ; [L408] int tmp___0 ; [L412] kernel_st = 0 [L162] COND TRUE m_i == 1 [L163] m_st = 0 [L167] COND TRUE t1_i == 1 [L168] t1_st = 0 [L251] COND FALSE !(M_E == 0) [L256] COND FALSE !(T1_E == 0) [L261] COND FALSE !(E_M == 0) [L266] COND FALSE !(E_1 == 0) [L304] int tmp ; [L305] int tmp___0 ; [L113] int __retres1 ; [L116] COND FALSE !(m_pc == 1) [L126] __retres1 = 0 [L128] return (__retres1); [L309] tmp = is_master_triggered() [L311] COND FALSE !(\read(tmp)) [L132] int __retres1 ; [L135] COND FALSE !(t1_pc == 1) [L145] __retres1 = 0 [L147] return (__retres1); [L317] tmp___0 = is_transmit1_triggered() [L319] COND FALSE !(\read(tmp___0)) [L279] COND FALSE !(M_E == 1) [L284] COND FALSE !(T1_E == 1) [L289] COND FALSE !(E_M == 1) [L294] COND FALSE !(E_1 == 1) [L420] COND TRUE 1 [L423] kernel_st = 1 [L198] int tmp ; Loop: [L202] COND TRUE 1 [L177] int __retres1 ; [L180] COND TRUE m_st == 0 [L181] __retres1 = 1 [L193] return (__retres1); [L205] tmp = exists_runnable_thread() [L207] COND TRUE \read(tmp) [L212] COND TRUE m_st == 0 [L213] int tmp_ndt_1; [L214] tmp_ndt_1 = __VERIFIER_nondet_int() [L215] COND FALSE !(\read(tmp_ndt_1)) [L226] COND TRUE t1_st == 0 [L227] int tmp_ndt_2; [L228] tmp_ndt_2 = __VERIFIER_nondet_int() [L229] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...