./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY --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 ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 08:43:45,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:43:45,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:43:45,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:43:45,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:43:45,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:43:45,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:43:45,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:43:45,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:43:45,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:43:45,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:43:45,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:43:45,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:43:45,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:43:45,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:43:45,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:43:45,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:43:45,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:43:45,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:43:45,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:43:45,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:43:45,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:43:45,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:43:45,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:43:45,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:43:45,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:43:45,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:43:45,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:43:45,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:43:45,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:43:45,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:43:45,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:43:45,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:43:45,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:43:45,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:43:45,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:43:45,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:43:45,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:43:45,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:43:45,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:43:45,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:43:45,615 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-11-07 08:43:45,666 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:43:45,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:43:45,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:43:45,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:43:45,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:43:45,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:43:45,670 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:43:45,670 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-07 08:43:45,670 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-07 08:43:45,670 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-07 08:43:45,671 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-07 08:43:45,672 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-07 08:43:45,672 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-07 08:43:45,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:43:45,672 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 08:43:45,673 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 08:43:45,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 08:43:45,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 08:43:45,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:43:45,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-07 08:43:45,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-07 08:43:45,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-07 08:43:45,674 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 08:43:45,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 08:43:45,675 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-07 08:43:45,675 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:43:45,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-07 08:43:45,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:43:45,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:43:45,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:43:45,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 08:43:45,678 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:43:45,679 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-07 08:43:45,679 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_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/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_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY 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 -> ea17b00cb6ed3e05e0ac7861fb220a62ceca6ba97bc4fe703ce3eb0d0ec5cbfe [2021-11-07 08:43:45,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:43:46,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:43:46,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:43:46,016 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:43:46,017 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:43:46,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2021-11-07 08:43:46,111 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/data/0f9a66cd5/19e3d7b58087457da10337155a75f4ca/FLAGd09b9594d [2021-11-07 08:43:46,627 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:43:46,627 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/sv-benchmarks/c/systemc/transmitter.01.cil.c [2021-11-07 08:43:46,636 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/data/0f9a66cd5/19e3d7b58087457da10337155a75f4ca/FLAGd09b9594d [2021-11-07 08:43:46,966 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/data/0f9a66cd5/19e3d7b58087457da10337155a75f4ca [2021-11-07 08:43:46,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:43:46,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 08:43:46,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:43:46,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:43:46,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:43:46,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:43:46" (1/1) ... [2021-11-07 08:43:46,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aceff50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:46, skipping insertion in model container [2021-11-07 08:43:46,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:43:46" (1/1) ... [2021-11-07 08:43:46,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:43:47,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:43:47,231 WARN L228 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_1aa964b5-2f31-4831-878b-de31024d2b32/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2021-11-07 08:43:47,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:43:47,342 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:43:47,379 WARN L228 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_1aa964b5-2f31-4831-878b-de31024d2b32/sv-benchmarks/c/systemc/transmitter.01.cil.c[706,719] [2021-11-07 08:43:47,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:43:47,433 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:43:47,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47 WrapperNode [2021-11-07 08:43:47,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:43:47,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 08:43:47,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 08:43:47,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 08:43:47,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47" (1/1) ... [2021-11-07 08:43:47,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47" (1/1) ... [2021-11-07 08:43:47,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 08:43:47,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:43:47,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:43:47,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:43:47,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47" (1/1) ... [2021-11-07 08:43:47,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47" (1/1) ... [2021-11-07 08:43:47,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47" (1/1) ... [2021-11-07 08:43:47,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47" (1/1) ... [2021-11-07 08:43:47,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47" (1/1) ... [2021-11-07 08:43:47,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47" (1/1) ... [2021-11-07 08:43:47,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47" (1/1) ... [2021-11-07 08:43:47,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:43:47,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:43:47,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:43:47,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:43:47,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47" (1/1) ... [2021-11-07 08:43:47,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-07 08:43:47,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:43:47,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-07 08:43:47,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-07 08:43:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:43:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 08:43:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:43:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:43:48,192 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:43:48,193 INFO L299 CfgBuilder]: Removed 73 assume(true) statements. [2021-11-07 08:43:48,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:43:48 BoogieIcfgContainer [2021-11-07 08:43:48,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:43:48,196 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-07 08:43:48,196 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-07 08:43:48,200 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-07 08:43:48,200 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 08:43:48,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.11 08:43:46" (1/3) ... [2021-11-07 08:43:48,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dc48708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 08:43:48, skipping insertion in model container [2021-11-07 08:43:48,202 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 08:43:48,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:47" (2/3) ... [2021-11-07 08:43:48,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dc48708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.11 08:43:48, skipping insertion in model container [2021-11-07 08:43:48,203 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-07 08:43:48,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:43:48" (3/3) ... [2021-11-07 08:43:48,204 INFO L389 chiAutomizerObserver]: Analyzing ICFG transmitter.01.cil.c [2021-11-07 08:43:48,249 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-07 08:43:48,249 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-07 08:43:48,249 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-07 08:43:48,249 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-07 08:43:48,249 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-07 08:43:48,249 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-07 08:43:48,249 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-07 08:43:48,249 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-07 08:43:48,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 121 states, 120 states have (on average 1.575) internal successors, (189), 120 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:48,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-11-07 08:43:48,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:43:48,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:43:48,302 INFO L842 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] [2021-11-07 08:43:48,302 INFO L843 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] [2021-11-07 08:43:48,302 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-07 08:43:48,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 121 states, 120 states have (on average 1.575) internal successors, (189), 120 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:48,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2021-11-07 08:43:48,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:43:48,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:43:48,314 INFO L842 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] [2021-11-07 08:43:48,314 INFO L843 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] [2021-11-07 08:43:48,322 INFO L791 eck$LassoCheckResult]: Stem: 105#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(21);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_1~0 := 2; 40#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 13#L367true havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 83#L154true assume !(1 == ~m_i~0);~m_st~0 := 2; 62#L161-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 71#L166-1true assume !(0 == ~M_E~0); 86#L250-1true assume !(0 == ~T1_E~0); 33#L255-1true assume !(0 == ~E_1~0); 72#L260-1true havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 46#L115true assume !(1 == ~m_pc~0); 50#L115-2true is_master_triggered_~__retres1~0 := 0; 60#L126true is_master_triggered_#res := is_master_triggered_~__retres1~0; 108#L127true activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 57#L300true assume !(0 != activate_threads_~tmp~1); 93#L300-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 106#L134true assume 1 == ~t1_pc~0; 94#L135true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 48#L145true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 78#L146true activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 10#L308true assume !(0 != activate_threads_~tmp___0~0); 53#L308-2true assume !(1 == ~M_E~0); 49#L273-1true assume !(1 == ~T1_E~0); 88#L278-1true assume !(1 == ~E_1~0); 99#L404-1true [2021-11-07 08:43:48,324 INFO L793 eck$LassoCheckResult]: Loop: 99#L404-1true assume !false; 73#L405true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 38#L225true assume !true; 21#L240true start_simulation_~kernel_st~0 := 2; 102#L154-1true start_simulation_~kernel_st~0 := 3; 95#L250-2true assume 0 == ~M_E~0;~M_E~0 := 1; 70#L250-4true assume !(0 == ~T1_E~0); 90#L255-3true assume 0 == ~E_1~0;~E_1~0 := 1; 7#L260-3true havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 42#L115-6true assume 1 == ~m_pc~0; 101#L116-2true assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 121#L126-2true is_master_triggered_#res := is_master_triggered_~__retres1~0; 51#L127-2true activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 64#L300-6true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 103#L300-8true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 118#L134-6true assume 1 == ~t1_pc~0; 39#L135-2true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 45#L145-2true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 100#L146-2true activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 43#L308-6true assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 8#L308-8true assume 1 == ~M_E~0;~M_E~0 := 2; 114#L273-3true assume 1 == ~T1_E~0;~T1_E~0 := 2; 30#L278-3true assume 1 == ~E_1~0;~E_1~0 := 2; 84#L283-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 67#L179-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 98#L191-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 119#L192-1true start_simulation_#t~ret13 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 16#L423true assume !(0 == start_simulation_~tmp~3); 52#L423-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret12, 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; 18#L179-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 63#L191-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 85#L192-2true stop_simulation_#t~ret12 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret12;havoc stop_simulation_#t~ret12; 12#L378true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 14#L385true stop_simulation_#res := stop_simulation_~__retres2~0; 68#L386true start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 37#L436true assume !(0 != start_simulation_~tmp___0~1); 99#L404-1true [2021-11-07 08:43:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1587080038, now seen corresponding path program 1 times [2021-11-07 08:43:48,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:48,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242070081] [2021-11-07 08:43:48,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:48,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:48,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:48,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242070081] [2021-11-07 08:43:48,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242070081] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:48,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:48,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:43:48,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357759383] [2021-11-07 08:43:48,654 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:43:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash -394546765, now seen corresponding path program 1 times [2021-11-07 08:43:48,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:48,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162143852] [2021-11-07 08:43:48,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:48,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:48,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:48,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162143852] [2021-11-07 08:43:48,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162143852] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:48,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:48,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 08:43:48,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81074999] [2021-11-07 08:43:48,696 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-07 08:43:48,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:48,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:43:48,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:43:48,716 INFO L87 Difference]: Start difference. First operand has 121 states, 120 states have (on average 1.575) internal successors, (189), 120 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:48,743 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2021-11-07 08:43:48,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:43:48,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 177 transitions. [2021-11-07 08:43:48,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2021-11-07 08:43:48,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 116 states and 172 transitions. [2021-11-07 08:43:48,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2021-11-07 08:43:48,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2021-11-07 08:43:48,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 172 transitions. [2021-11-07 08:43:48,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:43:48,764 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2021-11-07 08:43:48,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 172 transitions. [2021-11-07 08:43:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-11-07 08:43:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.4827586206896552) internal successors, (172), 115 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2021-11-07 08:43:48,805 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2021-11-07 08:43:48,805 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2021-11-07 08:43:48,805 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-07 08:43:48,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 172 transitions. [2021-11-07 08:43:48,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2021-11-07 08:43:48,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:43:48,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:43:48,810 INFO L842 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] [2021-11-07 08:43:48,811 INFO L843 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] [2021-11-07 08:43:48,811 INFO L791 eck$LassoCheckResult]: Stem: 365#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(21);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_1~0 := 2; 312#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 267#L367 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 268#L154 assume 1 == ~m_i~0;~m_st~0 := 0; 335#L161-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 336#L166-1 assume !(0 == ~M_E~0); 347#L250-1 assume !(0 == ~T1_E~0); 302#L255-1 assume !(0 == ~E_1~0); 303#L260-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 319#L115 assume !(1 == ~m_pc~0); 290#L115-2 is_master_triggered_~__retres1~0 := 0; 289#L126 is_master_triggered_#res := is_master_triggered_~__retres1~0; 332#L127 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 330#L300 assume !(0 != activate_threads_~tmp~1); 331#L300-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 359#L134 assume 1 == ~t1_pc~0; 360#L135 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 321#L145 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 322#L146 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 260#L308 assume !(0 != activate_threads_~tmp___0~0); 261#L308-2 assume !(1 == ~M_E~0); 323#L273-1 assume !(1 == ~T1_E~0); 324#L278-1 assume !(1 == ~E_1~0); 308#L404-1 [2021-11-07 08:43:48,812 INFO L793 eck$LassoCheckResult]: Loop: 308#L404-1 assume !false; 348#L405 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 309#L225 assume !false; 310#L202 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 350#L179 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 292#L191 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 344#L192 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 300#L206 assume !(0 != eval_~tmp~0); 281#L240 start_simulation_~kernel_st~0 := 2; 282#L154-1 start_simulation_~kernel_st~0 := 3; 361#L250-2 assume 0 == ~M_E~0;~M_E~0 := 1; 345#L250-4 assume !(0 == ~T1_E~0); 346#L255-3 assume 0 == ~E_1~0;~E_1~0 := 1; 255#L260-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 256#L115-6 assume !(1 == ~m_pc~0); 314#L115-8 is_master_triggered_~__retres1~0 := 0; 363#L126-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 325#L127-2 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 326#L300-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 338#L300-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 364#L134-6 assume !(1 == ~t1_pc~0); 293#L134-8 is_transmit1_triggered_~__retres1~1 := 0; 294#L145-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 318#L146-2 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 316#L308-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 257#L308-8 assume 1 == ~M_E~0;~M_E~0 := 2; 258#L273-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 296#L278-3 assume 1 == ~E_1~0;~E_1~0 := 2; 297#L283-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 341#L179-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 343#L191-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 362#L192-1 start_simulation_#t~ret13 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 270#L423 assume !(0 == start_simulation_~tmp~3); 271#L423-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret12, 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; 275#L179-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 276#L191-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 337#L192-2 stop_simulation_#t~ret12 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret12;havoc stop_simulation_#t~ret12; 265#L378 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 266#L385 stop_simulation_#res := stop_simulation_~__retres2~0; 269#L386 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 307#L436 assume !(0 != start_simulation_~tmp___0~1); 308#L404-1 [2021-11-07 08:43:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:48,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1890238808, now seen corresponding path program 1 times [2021-11-07 08:43:48,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:48,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979322672] [2021-11-07 08:43:48,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:48,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:48,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:48,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979322672] [2021-11-07 08:43:48,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979322672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:48,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:48,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:43:48,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764036527] [2021-11-07 08:43:48,877 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:43:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:48,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2145764385, now seen corresponding path program 1 times [2021-11-07 08:43:48,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:48,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483523421] [2021-11-07 08:43:48,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:48,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:48,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:48,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483523421] [2021-11-07 08:43:48,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483523421] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:48,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:48,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:43:48,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056173026] [2021-11-07 08:43:48,940 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-07 08:43:48,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:48,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:48,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:48,942 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. cyclomatic complexity: 57 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:49,123 INFO L93 Difference]: Finished difference Result 285 states and 404 transitions. [2021-11-07 08:43:49,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:49,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 404 transitions. [2021-11-07 08:43:49,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 240 [2021-11-07 08:43:49,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 404 transitions. [2021-11-07 08:43:49,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2021-11-07 08:43:49,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2021-11-07 08:43:49,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 404 transitions. [2021-11-07 08:43:49,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:43:49,140 INFO L681 BuchiCegarLoop]: Abstraction has 285 states and 404 transitions. [2021-11-07 08:43:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 404 transitions. [2021-11-07 08:43:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 266. [2021-11-07 08:43:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 266 states have (on average 1.4323308270676691) internal successors, (381), 265 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 381 transitions. [2021-11-07 08:43:49,160 INFO L704 BuchiCegarLoop]: Abstraction has 266 states and 381 transitions. [2021-11-07 08:43:49,161 INFO L587 BuchiCegarLoop]: Abstraction has 266 states and 381 transitions. [2021-11-07 08:43:49,161 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-07 08:43:49,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 381 transitions. [2021-11-07 08:43:49,164 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 238 [2021-11-07 08:43:49,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:43:49,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:43:49,166 INFO L842 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] [2021-11-07 08:43:49,166 INFO L843 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] [2021-11-07 08:43:49,166 INFO L791 eck$LassoCheckResult]: Stem: 783#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(21);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_1~0 := 2; 725#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 680#L367 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 681#L154 assume 1 == ~m_i~0;~m_st~0 := 0; 748#L161-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 749#L166-1 assume !(0 == ~M_E~0); 760#L250-1 assume !(0 == ~T1_E~0); 716#L255-1 assume !(0 == ~E_1~0); 717#L260-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 731#L115 assume !(1 == ~m_pc~0); 732#L115-2 is_master_triggered_~__retres1~0 := 0; 737#L126 is_master_triggered_#res := is_master_triggered_~__retres1~0; 745#L127 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 743#L300 assume !(0 != activate_threads_~tmp~1); 744#L300-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 775#L134 assume !(1 == ~t1_pc~0); 742#L134-2 is_transmit1_triggered_~__retres1~1 := 0; 733#L145 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 734#L146 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 673#L308 assume !(0 != activate_threads_~tmp___0~0); 674#L308-2 assume !(1 == ~M_E~0); 735#L273-1 assume !(1 == ~T1_E~0); 736#L278-1 assume !(1 == ~E_1~0); 772#L404-1 [2021-11-07 08:43:49,167 INFO L793 eck$LassoCheckResult]: Loop: 772#L404-1 assume !false; 874#L405 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 873#L225 assume !false; 872#L202 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 867#L179 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 864#L191 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 861#L192 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 857#L206 assume !(0 != eval_~tmp~0); 694#L240 start_simulation_~kernel_st~0 := 2; 695#L154-1 start_simulation_~kernel_st~0 := 3; 776#L250-2 assume 0 == ~M_E~0;~M_E~0 := 1; 757#L250-4 assume !(0 == ~T1_E~0); 758#L255-3 assume 0 == ~E_1~0;~E_1~0 := 1; 668#L260-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 669#L115-6 assume !(1 == ~m_pc~0); 727#L115-8 is_master_triggered_~__retres1~0 := 0; 786#L126-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 738#L127-2 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 739#L300-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 752#L300-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 782#L134-6 assume !(1 == ~t1_pc~0); 794#L134-8 is_transmit1_triggered_~__retres1~1 := 0; 848#L145-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 846#L146-2 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 844#L308-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 842#L308-8 assume 1 == ~M_E~0;~M_E~0 := 2; 789#L273-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 790#L278-3 assume 1 == ~E_1~0;~E_1~0 := 2; 838#L283-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 836#L179-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 832#L191-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 830#L192-1 start_simulation_#t~ret13 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 827#L423 assume !(0 == start_simulation_~tmp~3); 828#L423-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret12, 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; 898#L179-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 896#L191-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 894#L192-2 stop_simulation_#t~ret12 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret12;havoc stop_simulation_#t~ret12; 891#L378 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 888#L385 stop_simulation_#res := stop_simulation_~__retres2~0; 885#L386 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 882#L436 assume !(0 != start_simulation_~tmp___0~1); 772#L404-1 [2021-11-07 08:43:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:49,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 1 times [2021-11-07 08:43:49,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:49,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940183099] [2021-11-07 08:43:49,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:49,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:49,189 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:43:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:49,250 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:43:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2145764385, now seen corresponding path program 2 times [2021-11-07 08:43:49,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:49,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562391149] [2021-11-07 08:43:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:49,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:49,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:49,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562391149] [2021-11-07 08:43:49,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562391149] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:49,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:49,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:43:49,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363094026] [2021-11-07 08:43:49,303 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-07 08:43:49,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:49,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:43:49,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:49,305 INFO L87 Difference]: Start difference. First operand 266 states and 381 transitions. cyclomatic complexity: 117 Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:49,400 INFO L93 Difference]: Finished difference Result 449 states and 625 transitions. [2021-11-07 08:43:49,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 08:43:49,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 449 states and 625 transitions. [2021-11-07 08:43:49,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 416 [2021-11-07 08:43:49,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 449 states to 449 states and 625 transitions. [2021-11-07 08:43:49,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 449 [2021-11-07 08:43:49,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 449 [2021-11-07 08:43:49,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 449 states and 625 transitions. [2021-11-07 08:43:49,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:43:49,428 INFO L681 BuchiCegarLoop]: Abstraction has 449 states and 625 transitions. [2021-11-07 08:43:49,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states and 625 transitions. [2021-11-07 08:43:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 275. [2021-11-07 08:43:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 275 states have (on average 1.4181818181818182) internal successors, (390), 274 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 390 transitions. [2021-11-07 08:43:49,459 INFO L704 BuchiCegarLoop]: Abstraction has 275 states and 390 transitions. [2021-11-07 08:43:49,459 INFO L587 BuchiCegarLoop]: Abstraction has 275 states and 390 transitions. [2021-11-07 08:43:49,459 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-07 08:43:49,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 275 states and 390 transitions. [2021-11-07 08:43:49,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 247 [2021-11-07 08:43:49,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:43:49,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:43:49,463 INFO L842 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] [2021-11-07 08:43:49,463 INFO L843 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] [2021-11-07 08:43:49,464 INFO L791 eck$LassoCheckResult]: Stem: 1528#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(21);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_1~0 := 2; 1457#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1411#L367 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 1412#L154 assume 1 == ~m_i~0;~m_st~0 := 0; 1481#L161-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1482#L166-1 assume !(0 == ~M_E~0); 1495#L250-1 assume !(0 == ~T1_E~0); 1446#L255-1 assume !(0 == ~E_1~0); 1447#L260-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 1464#L115 assume !(1 == ~m_pc~0); 1465#L115-2 is_master_triggered_~__retres1~0 := 0; 1470#L126 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1478#L127 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1476#L300 assume !(0 != activate_threads_~tmp~1); 1477#L300-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1514#L134 assume !(1 == ~t1_pc~0); 1475#L134-2 is_transmit1_triggered_~__retres1~1 := 0; 1466#L145 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1467#L146 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1404#L308 assume !(0 != activate_threads_~tmp___0~0); 1405#L308-2 assume !(1 == ~M_E~0); 1468#L273-1 assume !(1 == ~T1_E~0); 1469#L278-1 assume !(1 == ~E_1~0); 1510#L404-1 [2021-11-07 08:43:49,464 INFO L793 eck$LassoCheckResult]: Loop: 1510#L404-1 assume !false; 1628#L405 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1626#L225 assume !false; 1600#L202 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1599#L179 assume !(0 == ~m_st~0); 1598#L183 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 1597#L191 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1591#L192 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 1588#L206 assume !(0 != eval_~tmp~0); 1555#L240 start_simulation_~kernel_st~0 := 2; 1525#L154-1 start_simulation_~kernel_st~0 := 3; 1515#L250-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1493#L250-4 assume !(0 == ~T1_E~0); 1494#L255-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1399#L260-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 1400#L115-6 assume !(1 == ~m_pc~0); 1459#L115-8 is_master_triggered_~__retres1~0 := 0; 1530#L126-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1471#L127-2 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 1472#L300-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1484#L300-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1622#L134-6 assume !(1 == ~t1_pc~0); 1437#L134-8 is_transmit1_triggered_~__retres1~1 := 0; 1438#L145-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1519#L146-2 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 1520#L308-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 1621#L308-8 assume 1 == ~M_E~0;~M_E~0 := 2; 1620#L273-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1619#L278-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1507#L283-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1488#L179-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1490#L191-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1518#L192-1 start_simulation_#t~ret13 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 1414#L423 assume !(0 == start_simulation_~tmp~3); 1415#L423-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret12, 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; 1636#L179-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1635#L191-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1634#L192-2 stop_simulation_#t~ret12 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret12;havoc stop_simulation_#t~ret12; 1633#L378 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1632#L385 stop_simulation_#res := stop_simulation_~__retres2~0; 1631#L386 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 1630#L436 assume !(0 != start_simulation_~tmp___0~1); 1510#L404-1 [2021-11-07 08:43:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:49,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 2 times [2021-11-07 08:43:49,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:49,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656044020] [2021-11-07 08:43:49,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:49,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:49,507 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:43:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:49,541 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:43:49,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:49,542 INFO L85 PathProgramCache]: Analyzing trace with hash -977189106, now seen corresponding path program 1 times [2021-11-07 08:43:49,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:49,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596839685] [2021-11-07 08:43:49,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:49,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:49,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:49,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596839685] [2021-11-07 08:43:49,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596839685] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:49,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:49,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 08:43:49,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977470439] [2021-11-07 08:43:49,652 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-07 08:43:49,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:49,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 08:43:49,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:49,654 INFO L87 Difference]: Start difference. First operand 275 states and 390 transitions. cyclomatic complexity: 117 Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:49,759 INFO L93 Difference]: Finished difference Result 583 states and 817 transitions. [2021-11-07 08:43:49,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 08:43:49,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 583 states and 817 transitions. [2021-11-07 08:43:49,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 555 [2021-11-07 08:43:49,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 583 states to 583 states and 817 transitions. [2021-11-07 08:43:49,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 583 [2021-11-07 08:43:49,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 583 [2021-11-07 08:43:49,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 583 states and 817 transitions. [2021-11-07 08:43:49,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:43:49,804 INFO L681 BuchiCegarLoop]: Abstraction has 583 states and 817 transitions. [2021-11-07 08:43:49,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states and 817 transitions. [2021-11-07 08:43:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 293. [2021-11-07 08:43:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 293 states have (on average 1.3822525597269624) internal successors, (405), 292 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 405 transitions. [2021-11-07 08:43:49,823 INFO L704 BuchiCegarLoop]: Abstraction has 293 states and 405 transitions. [2021-11-07 08:43:49,823 INFO L587 BuchiCegarLoop]: Abstraction has 293 states and 405 transitions. [2021-11-07 08:43:49,823 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-07 08:43:49,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 293 states and 405 transitions. [2021-11-07 08:43:49,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 265 [2021-11-07 08:43:49,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:43:49,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:43:49,828 INFO L842 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] [2021-11-07 08:43:49,828 INFO L843 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] [2021-11-07 08:43:49,829 INFO L791 eck$LassoCheckResult]: Stem: 2396#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(21);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_1~0 := 2; 2329#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2282#L367 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 2283#L154 assume 1 == ~m_i~0;~m_st~0 := 0; 2356#L161-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2357#L166-1 assume !(0 == ~M_E~0); 2368#L250-1 assume !(0 == ~T1_E~0); 2318#L255-1 assume !(0 == ~E_1~0); 2319#L260-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 2336#L115 assume !(1 == ~m_pc~0); 2337#L115-2 is_master_triggered_~__retres1~0 := 0; 2343#L126 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2353#L127 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 2351#L300 assume !(0 != activate_threads_~tmp~1); 2352#L300-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2386#L134 assume !(1 == ~t1_pc~0); 2350#L134-2 is_transmit1_triggered_~__retres1~1 := 0; 2339#L145 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2340#L146 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2275#L308 assume !(0 != activate_threads_~tmp___0~0); 2276#L308-2 assume !(1 == ~M_E~0); 2341#L273-1 assume !(1 == ~T1_E~0); 2342#L278-1 assume !(1 == ~E_1~0); 2382#L404-1 [2021-11-07 08:43:49,829 INFO L793 eck$LassoCheckResult]: Loop: 2382#L404-1 assume !false; 2459#L405 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2458#L225 assume !false; 2457#L202 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2454#L179 assume !(0 == ~m_st~0); 2455#L183 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2456#L191 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2450#L192 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 2451#L206 assume !(0 != eval_~tmp~0); 2525#L240 start_simulation_~kernel_st~0 := 2; 2524#L154-1 start_simulation_~kernel_st~0 := 3; 2523#L250-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2522#L250-4 assume !(0 == ~T1_E~0); 2521#L255-3 assume 0 == ~E_1~0;~E_1~0 := 1; 2270#L260-3 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 2271#L115-6 assume !(1 == ~m_pc~0); 2331#L115-8 is_master_triggered_~__retres1~0 := 0; 2449#L126-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2448#L127-2 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 2447#L300-6 assume !(0 != activate_threads_~tmp~1); 2446#L300-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2445#L134-6 assume !(1 == ~t1_pc~0); 2444#L134-8 is_transmit1_triggered_~__retres1~1 := 0; 2443#L145-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2442#L146-2 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 2441#L308-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 2440#L308-8 assume 1 == ~M_E~0;~M_E~0 := 2; 2439#L273-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2438#L278-3 assume 1 == ~E_1~0;~E_1~0 := 2; 2436#L283-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2434#L179-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2430#L191-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2427#L192-1 start_simulation_#t~ret13 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret13;havoc start_simulation_#t~ret13; 2424#L423 assume !(0 == start_simulation_~tmp~3); 2425#L423-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret12, 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; 2467#L179-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2466#L191-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2465#L192-2 stop_simulation_#t~ret12 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret12;havoc stop_simulation_#t~ret12; 2464#L378 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2463#L385 stop_simulation_#res := stop_simulation_~__retres2~0; 2462#L386 start_simulation_#t~ret14 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret14;havoc start_simulation_#t~ret14; 2461#L436 assume !(0 != start_simulation_~tmp___0~1); 2382#L404-1 [2021-11-07 08:43:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 3 times [2021-11-07 08:43:49,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:49,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051336025] [2021-11-07 08:43:49,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:49,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:49,844 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:43:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:49,863 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:43:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1512339856, now seen corresponding path program 1 times [2021-11-07 08:43:49,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:49,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501997524] [2021-11-07 08:43:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:49,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:49,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:49,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501997524] [2021-11-07 08:43:49,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501997524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:49,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:49,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:43:49,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128257400] [2021-11-07 08:43:49,909 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-11-07 08:43:49,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:49,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:43:49,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:43:49,910 INFO L87 Difference]: Start difference. First operand 293 states and 405 transitions. cyclomatic complexity: 114 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:49,946 INFO L93 Difference]: Finished difference Result 433 states and 584 transitions. [2021-11-07 08:43:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:43:49,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 433 states and 584 transitions. [2021-11-07 08:43:49,952 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 403 [2021-11-07 08:43:49,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 433 states to 433 states and 584 transitions. [2021-11-07 08:43:49,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 433 [2021-11-07 08:43:49,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2021-11-07 08:43:49,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 433 states and 584 transitions. [2021-11-07 08:43:49,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:43:49,958 INFO L681 BuchiCegarLoop]: Abstraction has 433 states and 584 transitions. [2021-11-07 08:43:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 584 transitions. [2021-11-07 08:43:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 414. [2021-11-07 08:43:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 414 states have (on average 1.355072463768116) internal successors, (561), 413 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 561 transitions. [2021-11-07 08:43:49,972 INFO L704 BuchiCegarLoop]: Abstraction has 414 states and 561 transitions. [2021-11-07 08:43:49,973 INFO L587 BuchiCegarLoop]: Abstraction has 414 states and 561 transitions. [2021-11-07 08:43:49,973 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-07 08:43:49,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 414 states and 561 transitions. [2021-11-07 08:43:49,976 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 384 [2021-11-07 08:43:49,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:43:49,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:43:49,981 INFO L842 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-11-07 08:43:49,981 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:43:49,981 INFO L791 eck$LassoCheckResult]: Stem: 3126#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(21);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_1~0 := 2; 3061#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 3014#L367 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 3015#L154 assume 1 == ~m_i~0;~m_st~0 := 0; 3085#L161-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 3086#L166-1 assume !(0 == ~M_E~0); 3097#L250-1 assume !(0 == ~T1_E~0); 3049#L255-1 assume !(0 == ~E_1~0); 3050#L260-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 3068#L115 assume !(1 == ~m_pc~0); 3069#L115-2 is_master_triggered_~__retres1~0 := 0; 3074#L126 is_master_triggered_#res := is_master_triggered_~__retres1~0; 3082#L127 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 3080#L300 assume !(0 != activate_threads_~tmp~1); 3081#L300-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 3114#L134 assume !(1 == ~t1_pc~0); 3077#L134-2 is_transmit1_triggered_~__retres1~1 := 0; 3070#L145 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 3071#L146 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 3007#L308 assume !(0 != activate_threads_~tmp___0~0); 3008#L308-2 assume !(1 == ~M_E~0); 3072#L273-1 assume !(1 == ~T1_E~0); 3073#L278-1 assume !(1 == ~E_1~0); 3109#L404-1 assume !false; 3372#L405 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 3196#L225 [2021-11-07 08:43:49,982 INFO L793 eck$LassoCheckResult]: Loop: 3196#L225 assume !false; 3197#L202 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 3363#L179 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 3362#L191 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 3361#L192 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 3359#L206 assume 0 != eval_~tmp~0; 3325#L206-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 3130#L214 assume !(0 != eval_~tmp_ndt_1~0); 3131#L211 assume !(0 == ~t1_st~0); 3196#L225 [2021-11-07 08:43:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash 916255881, now seen corresponding path program 1 times [2021-11-07 08:43:49,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:49,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298401618] [2021-11-07 08:43:49,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:49,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,010 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:43:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,039 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:43:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:50,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1324144305, now seen corresponding path program 1 times [2021-11-07 08:43:50,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:50,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444619462] [2021-11-07 08:43:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:50,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,061 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:43:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,070 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:43:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1901692119, now seen corresponding path program 1 times [2021-11-07 08:43:50,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:50,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317446199] [2021-11-07 08:43:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:50,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:50,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:50,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317446199] [2021-11-07 08:43:50,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317446199] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:50,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:50,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 08:43:50,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286728809] [2021-11-07 08:43:50,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:50,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:43:50,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:43:50,248 INFO L87 Difference]: Start difference. First operand 414 states and 561 transitions. cyclomatic complexity: 150 Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:50,303 INFO L93 Difference]: Finished difference Result 718 states and 961 transitions. [2021-11-07 08:43:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:43:50,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 718 states and 961 transitions. [2021-11-07 08:43:50,329 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 628 [2021-11-07 08:43:50,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 718 states to 718 states and 961 transitions. [2021-11-07 08:43:50,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 718 [2021-11-07 08:43:50,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 718 [2021-11-07 08:43:50,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 718 states and 961 transitions. [2021-11-07 08:43:50,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:43:50,351 INFO L681 BuchiCegarLoop]: Abstraction has 718 states and 961 transitions. [2021-11-07 08:43:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states and 961 transitions. [2021-11-07 08:43:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 649. [2021-11-07 08:43:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 649 states have (on average 1.3543913713405238) internal successors, (879), 648 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 879 transitions. [2021-11-07 08:43:50,395 INFO L704 BuchiCegarLoop]: Abstraction has 649 states and 879 transitions. [2021-11-07 08:43:50,395 INFO L587 BuchiCegarLoop]: Abstraction has 649 states and 879 transitions. [2021-11-07 08:43:50,395 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-07 08:43:50,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 649 states and 879 transitions. [2021-11-07 08:43:50,400 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 583 [2021-11-07 08:43:50,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:43:50,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:43:50,401 INFO L842 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-11-07 08:43:50,401 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:43:50,402 INFO L791 eck$LassoCheckResult]: Stem: 4287#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(21);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_1~0 := 2; 4203#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 4156#L367 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 4157#L154 assume 1 == ~m_i~0;~m_st~0 := 0; 4234#L161-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 4235#L166-1 assume !(0 == ~M_E~0); 4246#L250-1 assume !(0 == ~T1_E~0); 4191#L255-1 assume !(0 == ~E_1~0); 4192#L260-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 4213#L115 assume !(1 == ~m_pc~0); 4214#L115-2 is_master_triggered_~__retres1~0 := 0; 4230#L126 is_master_triggered_#res := is_master_triggered_~__retres1~0; 4231#L127 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 4228#L300 assume !(0 != activate_threads_~tmp~1); 4229#L300-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 4288#L134 assume !(1 == ~t1_pc~0); 4289#L134-2 is_transmit1_triggered_~__retres1~1 := 0; 4215#L145 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 4216#L146 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 4148#L308 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 4149#L308-2 assume !(1 == ~M_E~0); 4223#L273-1 assume !(1 == ~T1_E~0); 4266#L278-1 assume !(1 == ~E_1~0); 4267#L404-1 assume !false; 4607#L405 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 4604#L225 [2021-11-07 08:43:50,402 INFO L793 eck$LassoCheckResult]: Loop: 4604#L225 assume !false; 4601#L202 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 4599#L179 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 4596#L191 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 4594#L192 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 4592#L206 assume 0 != eval_~tmp~0; 4590#L206-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 4295#L214 assume !(0 != eval_~tmp_ndt_1~0); 4296#L211 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 4345#L228 assume !(0 != eval_~tmp_ndt_2~0); 4604#L225 [2021-11-07 08:43:50,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:50,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1281699405, now seen corresponding path program 1 times [2021-11-07 08:43:50,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:50,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393837465] [2021-11-07 08:43:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:50,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:50,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:50,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393837465] [2021-11-07 08:43:50,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393837465] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:50,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:50,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:43:50,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123693703] [2021-11-07 08:43:50,442 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-07 08:43:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1901200370, now seen corresponding path program 1 times [2021-11-07 08:43:50,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:50,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986112341] [2021-11-07 08:43:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:50,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,447 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:43:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,451 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:43:50,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:43:50,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:43:50,541 INFO L87 Difference]: Start difference. First operand 649 states and 879 transitions. cyclomatic complexity: 234 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:50,549 INFO L93 Difference]: Finished difference Result 543 states and 738 transitions. [2021-11-07 08:43:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:43:50,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 543 states and 738 transitions. [2021-11-07 08:43:50,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 513 [2021-11-07 08:43:50,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 543 states to 543 states and 738 transitions. [2021-11-07 08:43:50,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 543 [2021-11-07 08:43:50,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 543 [2021-11-07 08:43:50,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 543 states and 738 transitions. [2021-11-07 08:43:50,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-07 08:43:50,574 INFO L681 BuchiCegarLoop]: Abstraction has 543 states and 738 transitions. [2021-11-07 08:43:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states and 738 transitions. [2021-11-07 08:43:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2021-11-07 08:43:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 543 states have (on average 1.3591160220994476) internal successors, (738), 542 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 08:43:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 738 transitions. [2021-11-07 08:43:50,587 INFO L704 BuchiCegarLoop]: Abstraction has 543 states and 738 transitions. [2021-11-07 08:43:50,587 INFO L587 BuchiCegarLoop]: Abstraction has 543 states and 738 transitions. [2021-11-07 08:43:50,587 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-07 08:43:50,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 543 states and 738 transitions. [2021-11-07 08:43:50,591 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 513 [2021-11-07 08:43:50,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-07 08:43:50,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-07 08:43:50,592 INFO L842 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-11-07 08:43:50,592 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:43:50,592 INFO L791 eck$LassoCheckResult]: Stem: 5463#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(21);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_1~0 := 2; 5396#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 5352#L367 havoc start_simulation_#t~ret13, start_simulation_#t~ret14, 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; 5353#L154 assume 1 == ~m_i~0;~m_st~0 := 0; 5424#L161-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5425#L166-1 assume !(0 == ~M_E~0); 5436#L250-1 assume !(0 == ~T1_E~0); 5386#L255-1 assume !(0 == ~E_1~0); 5387#L260-1 havoc activate_threads_#t~ret10, activate_threads_#t~ret11, 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; 5405#L115 assume !(1 == ~m_pc~0); 5406#L115-2 is_master_triggered_~__retres1~0 := 0; 5411#L126 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5421#L127 activate_threads_#t~ret10 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret10;havoc activate_threads_#t~ret10; 5419#L300 assume !(0 != activate_threads_~tmp~1); 5420#L300-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5453#L134 assume !(1 == ~t1_pc~0); 5418#L134-2 is_transmit1_triggered_~__retres1~1 := 0; 5407#L145 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5408#L146 activate_threads_#t~ret11 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret11;havoc activate_threads_#t~ret11; 5345#L308 assume !(0 != activate_threads_~tmp___0~0); 5346#L308-2 assume !(1 == ~M_E~0); 5409#L273-1 assume !(1 == ~T1_E~0); 5410#L278-1 assume !(1 == ~E_1~0); 5448#L404-1 assume !false; 5649#L405 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret7, eval_#t~nondet8, eval_~tmp_ndt_1~0, eval_#t~nondet9, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 5442#L225 [2021-11-07 08:43:50,592 INFO L793 eck$LassoCheckResult]: Loop: 5442#L225 assume !false; 5646#L202 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5644#L179 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5642#L191 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5640#L192 eval_#t~ret7 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret7;havoc eval_#t~ret7; 5638#L206 assume 0 != eval_~tmp~0; 5636#L206-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 5470#L214 assume !(0 != eval_~tmp_ndt_1~0); 5452#L211 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 5441#L228 assume !(0 != eval_~tmp_ndt_2~0); 5442#L225 [2021-11-07 08:43:50,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:50,593 INFO L85 PathProgramCache]: Analyzing trace with hash 916255881, now seen corresponding path program 2 times [2021-11-07 08:43:50,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:50,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229334482] [2021-11-07 08:43:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:50,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,632 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:43:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,644 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:43:50,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:50,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1901200370, now seen corresponding path program 2 times [2021-11-07 08:43:50,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:50,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535826898] [2021-11-07 08:43:50,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:50,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,659 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:43:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,669 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:43:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1177085590, now seen corresponding path program 1 times [2021-11-07 08:43:50,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:50,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086532987] [2021-11-07 08:43:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:50,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,689 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 08:43:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 08:43:50,709 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 08:43:51,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.11 08:43:51 BoogieIcfgContainer [2021-11-07 08:43:51,549 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-11-07 08:43:51,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 08:43:51,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 08:43:51,550 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 08:43:51,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:43:48" (3/4) ... [2021-11-07 08:43:51,553 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-11-07 08:43:51,609 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/witness.graphml [2021-11-07 08:43:51,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 08:43:51,611 INFO L168 Benchmark]: Toolchain (without parser) took 4639.82 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 56.5 MB in the beginning and 37.5 MB in the end (delta: 19.0 MB). Peak memory consumption was 39.7 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:51,612 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 96.5 MB. Free memory is still 73.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:43:51,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.04 ms. Allocated memory is still 96.5 MB. Free memory was 56.2 MB in the beginning and 69.5 MB in the end (delta: -13.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:51,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.86 ms. Allocated memory is still 96.5 MB. Free memory was 69.5 MB in the beginning and 67.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:51,613 INFO L168 Benchmark]: Boogie Preprocessor took 54.98 ms. Allocated memory is still 96.5 MB. Free memory was 67.3 MB in the beginning and 65.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:51,614 INFO L168 Benchmark]: RCFGBuilder took 629.21 ms. Allocated memory is still 96.5 MB. Free memory was 65.3 MB in the beginning and 48.0 MB in the end (delta: 17.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:51,614 INFO L168 Benchmark]: BuchiAutomizer took 3352.69 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 48.0 MB in the beginning and 39.6 MB in the end (delta: 8.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:51,615 INFO L168 Benchmark]: Witness Printer took 60.36 ms. Allocated memory is still 117.4 MB. Free memory was 39.6 MB in the beginning and 37.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:51,618 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 96.5 MB. Free memory is still 73.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 462.04 ms. Allocated memory is still 96.5 MB. Free memory was 56.2 MB in the beginning and 69.5 MB in the end (delta: -13.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.86 ms. Allocated memory is still 96.5 MB. Free memory was 69.5 MB in the beginning and 67.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.98 ms. Allocated memory is still 96.5 MB. Free memory was 67.3 MB in the beginning and 65.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 629.21 ms. Allocated memory is still 96.5 MB. Free memory was 65.3 MB in the beginning and 48.0 MB in the end (delta: 17.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3352.69 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 48.0 MB in the beginning and 39.6 MB in the end (delta: 8.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * Witness Printer took 60.36 ms. Allocated memory is still 117.4 MB. Free memory was 39.6 MB in the beginning and 37.5 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 543 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 571 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 649 states and ocurred in iteration 6. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1196 SDtfs, 1610 SDslu, 1586 SDs, 0 SdLazy, 176 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc1 concLT0 SILN1 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 201]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=9335} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1cfa7853=0, NULL=9337, NULL=0, \result=0, __retres1=0, NULL=9335, tmp=1, \result=0, kernel_st=1, __retres1=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@191e79c7=0, t1_pc=0, __retres1=1, T1_E=2, NULL=9336, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c66c7d6=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=9338, m_i=1, t1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4bb64e1b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1c196b61=0, m_st=0, NULL=0, tmp___0=0, tmp=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5eb8c36d=0, t1_i=1, m_pc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@32e97275=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 201]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int m_st ; [L28] int t1_st ; [L29] int m_i ; [L30] int t1_i ; [L31] int M_E = 2; [L32] int T1_E = 2; [L33] int E_1 = 2; [L449] int __retres1 ; [L364] m_i = 1 [L365] t1_i = 1 [L390] int kernel_st ; [L391] int tmp ; [L392] int tmp___0 ; [L396] kernel_st = 0 [L161] COND TRUE m_i == 1 [L162] m_st = 0 [L166] COND TRUE t1_i == 1 [L167] t1_st = 0 [L250] COND FALSE !(M_E == 0) [L255] COND FALSE !(T1_E == 0) [L260] COND FALSE !(E_1 == 0) [L293] int tmp ; [L294] int tmp___0 ; [L112] int __retres1 ; [L115] COND FALSE !(m_pc == 1) [L125] __retres1 = 0 [L127] return (__retres1); [L298] tmp = is_master_triggered() [L300] COND FALSE !(\read(tmp)) [L131] int __retres1 ; [L134] COND FALSE !(t1_pc == 1) [L144] __retres1 = 0 [L146] return (__retres1); [L306] tmp___0 = is_transmit1_triggered() [L308] COND FALSE !(\read(tmp___0)) [L273] COND FALSE !(M_E == 1) [L278] COND FALSE !(T1_E == 1) [L283] COND FALSE !(E_1 == 1) [L404] COND TRUE 1 [L407] kernel_st = 1 [L197] int tmp ; Loop: [L201] COND TRUE 1 [L176] int __retres1 ; [L179] COND TRUE m_st == 0 [L180] __retres1 = 1 [L192] return (__retres1); [L204] tmp = exists_runnable_thread() [L206] COND TRUE \read(tmp) [L211] COND TRUE m_st == 0 [L212] int tmp_ndt_1; [L213] tmp_ndt_1 = __VERIFIER_nondet_int() [L214] COND FALSE !(\read(tmp_ndt_1)) [L225] COND TRUE t1_st == 0 [L226] int tmp_ndt_2; [L227] tmp_ndt_2 = __VERIFIER_nondet_int() [L228] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-11-07 08:43:51,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1aa964b5-2f31-4831-878b-de31024d2b32/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)