./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/transmitter.01.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18c351eab8f6ce363bd7076ce800527c30b2b6c5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:04,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:04,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:04,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:04,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:04,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:04,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:04,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:04,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:04,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:04,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:04,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:04,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:04,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:04,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:04,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:04,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:04,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:04,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:04,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:04,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:04,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:04,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:04,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:04,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:04,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:04,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:04,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:04,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:04,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:04,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:04,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:04,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:04,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:04,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:04,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:04,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:04,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:04,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:04,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:04,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:04,912 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 08:59:04,926 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:04,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:04,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:04,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:04,928 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:04,928 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:04,928 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:04,928 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:04,928 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:04,929 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:04,929 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:04,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:04,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:04,929 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:04,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:04,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:04,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:04,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:04,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:04,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:04,931 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:04,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:04,931 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:04,932 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:04,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:04,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:04,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:04,932 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:04,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:04,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:04,933 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:04,934 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:04,934 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18c351eab8f6ce363bd7076ce800527c30b2b6c5 [2019-10-22 08:59:04,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:04,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:04,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:04,977 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:04,978 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:04,979 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/../../sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-10-22 08:59:05,030 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/data/242156247/fb1023de78de4aa9b41cb6e8ba75920a/FLAG6d05660c9 [2019-10-22 08:59:05,422 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:05,423 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-10-22 08:59:05,430 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/data/242156247/fb1023de78de4aa9b41cb6e8ba75920a/FLAG6d05660c9 [2019-10-22 08:59:05,785 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/data/242156247/fb1023de78de4aa9b41cb6e8ba75920a [2019-10-22 08:59:05,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:05,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:05,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:05,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:05,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:05,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:05" (1/1) ... [2019-10-22 08:59:05,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f06e0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:05, skipping insertion in model container [2019-10-22 08:59:05,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:05" (1/1) ... [2019-10-22 08:59:05,804 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:05,839 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:05,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:06,073 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:06,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:06,119 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:06,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06 WrapperNode [2019-10-22 08:59:06,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:06,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:06,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:06,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:06,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:06,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:06,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:06,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:06,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... [2019-10-22 08:59:06,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:06,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:06,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:06,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:06,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:06,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:06,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:06,891 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:06,891 INFO L284 CfgBuilder]: Removed 73 assume(true) statements. [2019-10-22 08:59:06,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:06 BoogieIcfgContainer [2019-10-22 08:59:06,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:06,893 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:06,893 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:06,898 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:06,899 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:06,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:05" (1/3) ... [2019-10-22 08:59:06,900 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@509325d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:06, skipping insertion in model container [2019-10-22 08:59:06,900 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:06,900 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:06" (2/3) ... [2019-10-22 08:59:06,901 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@509325d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:06, skipping insertion in model container [2019-10-22 08:59:06,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:06,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:06" (3/3) ... [2019-10-22 08:59:06,904 INFO L371 chiAutomizerObserver]: Analyzing ICFG transmitter.01.cil.c [2019-10-22 08:59:06,944 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:06,945 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:06,945 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:06,945 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:06,946 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:06,946 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:06,946 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:06,947 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:06,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states. [2019-10-22 08:59:06,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 08:59:06,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:06,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:06,994 INFO L849 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] [2019-10-22 08:59:06,995 INFO L850 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] [2019-10-22 08:59:06,995 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:06,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states. [2019-10-22 08:59:07,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2019-10-22 08:59:07,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:07,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:07,002 INFO L849 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] [2019-10-22 08:59:07,002 INFO L850 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] [2019-10-22 08:59:07,007 INFO L791 eck$LassoCheckResult]: Stem: 106#ULTIMATE.startENTRYtrue ~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; 14#L-1true havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 123#L357true havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 40#L144true assume !(1 == ~m_i~0);~m_st~0 := 2; 111#L151-1true assume 1 == ~t1_i~0;~t1_st~0 := 0; 117#L156-1true assume !(0 == ~M_E~0); 55#L240-1true assume !(0 == ~T1_E~0); 92#L245-1true assume !(0 == ~E_1~0); 115#L250-1true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, activate_threads_~tmp~1, activate_threads_~tmp___0~0;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~0;havoc is_master_triggered_#res;havoc is_master_triggered_~__retres1~0;havoc is_master_triggered_~__retres1~0; 66#L105true assume !(1 == ~m_pc~0); 61#L105-2true is_master_triggered_~__retres1~0 := 0; 68#L116true is_master_triggered_#res := is_master_triggered_~__retres1~0; 35#L117true activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 51#L290true assume !(0 != activate_threads_~tmp~1); 47#L290-2true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 88#L124true assume 1 == ~t1_pc~0; 27#L125true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 89#L135true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 29#L136true activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 72#L298true assume !(0 != activate_threads_~tmp___0~0); 42#L298-2true assume !(1 == ~M_E~0); 4#L263-1true assume !(1 == ~T1_E~0); 48#L268-1true assume !(1 == ~E_1~0); 73#L394-1true [2019-10-22 08:59:07,008 INFO L793 eck$LassoCheckResult]: Loop: 73#L394-1true assume !false; 30#L395true start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 98#L215true assume !true; 5#L230true start_simulation_~kernel_st~0 := 2; 38#L144-1true start_simulation_~kernel_st~0 := 3; 80#L240-2true assume 0 == ~M_E~0;~M_E~0 := 1; 77#L240-4true assume !(0 == ~T1_E~0); 90#L245-3true assume 0 == ~E_1~0;~E_1~0 := 1; 113#L250-3true havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 79#L105-6true assume 1 == ~m_pc~0; 8#L106-2true assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 62#L116-2true is_master_triggered_#res := is_master_triggered_~__retres1~0; 9#L117-2true activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 23#L290-6true assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 18#L290-8true havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 95#L124-6true assume 1 == ~t1_pc~0; 21#L125-2true assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 86#L135-2true is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 22#L136-2true activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 54#L298-6true assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 53#L298-8true assume 1 == ~M_E~0;~M_E~0 := 2; 17#L263-3true assume 1 == ~T1_E~0;~T1_E~0 := 2; 33#L268-3true assume 1 == ~E_1~0;~E_1~0 := 2; 81#L273-3true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 31#L169-1true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 109#L181-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 93#L182-1true start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 96#L413true assume !(0 == start_simulation_~tmp~3); 101#L413-1true havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 26#L169-2true assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 108#L181-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 70#L182-2true stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 122#L368true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 60#L375true stop_simulation_#res := stop_simulation_~__retres2~0; 3#L376true start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 118#L426true assume !(0 != start_simulation_~tmp___0~1); 73#L394-1true [2019-10-22 08:59:07,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1587080038, now seen corresponding path program 1 times [2019-10-22 08:59:07,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883643230] [2019-10-22 08:59:07,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:07,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883643230] [2019-10-22 08:59:07,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:07,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:07,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566392580] [2019-10-22 08:59:07,133 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:07,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,133 INFO L82 PathProgramCache]: Analyzing trace with hash -394546765, now seen corresponding path program 1 times [2019-10-22 08:59:07,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629347453] [2019-10-22 08:59:07,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:07,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629347453] [2019-10-22 08:59:07,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:07,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:07,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899053964] [2019-10-22 08:59:07,148 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:07,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:07,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:07,163 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2019-10-22 08:59:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:07,182 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2019-10-22 08:59:07,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:07,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 177 transitions. [2019-10-22 08:59:07,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2019-10-22 08:59:07,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 116 states and 172 transitions. [2019-10-22 08:59:07,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-10-22 08:59:07,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-10-22 08:59:07,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 172 transitions. [2019-10-22 08:59:07,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:07,196 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2019-10-22 08:59:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 172 transitions. [2019-10-22 08:59:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-10-22 08:59:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-22 08:59:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2019-10-22 08:59:07,226 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2019-10-22 08:59:07,226 INFO L591 BuchiCegarLoop]: Abstraction has 116 states and 172 transitions. [2019-10-22 08:59:07,226 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:07,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 172 transitions. [2019-10-22 08:59:07,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2019-10-22 08:59:07,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:07,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:07,232 INFO L849 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] [2019-10-22 08:59:07,232 INFO L850 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] [2019-10-22 08:59:07,232 INFO L791 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY ~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; 276#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 277#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 327#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 328#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 366#L156-1 assume !(0 == ~M_E~0); 339#L240-1 assume !(0 == ~T1_E~0); 340#L245-1 assume !(0 == ~E_1~0); 358#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 345#L105 assume !(1 == ~m_pc~0); 319#L105-2 is_master_triggered_~__retres1~0 := 0; 318#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 320#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 321#L290 assume !(0 != activate_threads_~tmp~1); 332#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 333#L124 assume 1 == ~t1_pc~0; 302#L125 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 303#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 307#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 308#L298 assume !(0 != activate_threads_~tmp___0~0); 329#L298-2 assume !(1 == ~M_E~0); 253#L263-1 assume !(1 == ~T1_E~0); 254#L268-1 assume !(1 == ~E_1~0); 334#L394-1 [2019-10-22 08:59:07,232 INFO L793 eck$LassoCheckResult]: Loop: 334#L394-1 assume !false; 309#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 273#L215 assume !false; 364#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 313#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 314#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 361#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 356#L196 assume !(0 != eval_~tmp~0); 255#L230 start_simulation_~kernel_st~0 := 2; 256#L144-1 start_simulation_~kernel_st~0 := 3; 324#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 351#L240-4 assume !(0 == ~T1_E~0); 352#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 357#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 355#L105-6 assume 1 == ~m_pc~0; 262#L106-2 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 264#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 267#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 268#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 282#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 283#L124-6 assume 1 == ~t1_pc~0; 289#L125-2 assume 1 == ~E_1~0;is_transmit1_triggered_~__retres1~1 := 1; 290#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 292#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 293#L298-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 338#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 280#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 281#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 316#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 310#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 312#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 359#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 360#L413 assume !(0 == start_simulation_~tmp~3); 362#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, 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; 299#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 300#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 347#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 348#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 343#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 251#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 252#L426 assume !(0 != start_simulation_~tmp___0~1); 334#L394-1 [2019-10-22 08:59:07,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1890238808, now seen corresponding path program 1 times [2019-10-22 08:59:07,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301831828] [2019-10-22 08:59:07,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,233 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:07,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301831828] [2019-10-22 08:59:07,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:07,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:07,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039479605] [2019-10-22 08:59:07,268 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:07,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,269 INFO L82 PathProgramCache]: Analyzing trace with hash 500242205, now seen corresponding path program 1 times [2019-10-22 08:59:07,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260880231] [2019-10-22 08:59:07,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:07,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260880231] [2019-10-22 08:59:07,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:07,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:07,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583687088] [2019-10-22 08:59:07,311 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:07,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:07,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:07,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:07,312 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. cyclomatic complexity: 57 Second operand 3 states. [2019-10-22 08:59:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:07,381 INFO L93 Difference]: Finished difference Result 203 states and 294 transitions. [2019-10-22 08:59:07,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:07,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 294 transitions. [2019-10-22 08:59:07,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 177 [2019-10-22 08:59:07,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 203 states and 294 transitions. [2019-10-22 08:59:07,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2019-10-22 08:59:07,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2019-10-22 08:59:07,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 203 states and 294 transitions. [2019-10-22 08:59:07,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:07,389 INFO L688 BuchiCegarLoop]: Abstraction has 203 states and 294 transitions. [2019-10-22 08:59:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states and 294 transitions. [2019-10-22 08:59:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199. [2019-10-22 08:59:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-22 08:59:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 289 transitions. [2019-10-22 08:59:07,408 INFO L711 BuchiCegarLoop]: Abstraction has 199 states and 289 transitions. [2019-10-22 08:59:07,408 INFO L591 BuchiCegarLoop]: Abstraction has 199 states and 289 transitions. [2019-10-22 08:59:07,408 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:07,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 199 states and 289 transitions. [2019-10-22 08:59:07,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 175 [2019-10-22 08:59:07,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:07,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:07,414 INFO L849 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] [2019-10-22 08:59:07,414 INFO L850 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] [2019-10-22 08:59:07,414 INFO L791 eck$LassoCheckResult]: Stem: 705#ULTIMATE.startENTRY ~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; 604#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 605#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 655#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 656#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 707#L156-1 assume !(0 == ~M_E~0); 667#L240-1 assume !(0 == ~T1_E~0); 668#L245-1 assume !(0 == ~E_1~0); 696#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 677#L105 assume !(1 == ~m_pc~0); 646#L105-2 is_master_triggered_~__retres1~0 := 0; 645#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 647#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 648#L290 assume !(0 != activate_threads_~tmp~1); 660#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 661#L124 assume !(1 == ~t1_pc~0); 691#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 692#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 638#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 639#L298 assume !(0 != activate_threads_~tmp___0~0); 657#L298-2 assume !(1 == ~M_E~0); 581#L263-1 assume !(1 == ~T1_E~0); 582#L268-1 assume !(1 == ~E_1~0); 662#L394-1 [2019-10-22 08:59:07,414 INFO L793 eck$LassoCheckResult]: Loop: 662#L394-1 assume !false; 636#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 637#L215 assume !false; 703#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 641#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 642#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 742#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 739#L196 assume !(0 != eval_~tmp~0); 738#L230 start_simulation_~kernel_st~0 := 2; 737#L144-1 start_simulation_~kernel_st~0 := 3; 736#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 735#L240-4 assume !(0 == ~T1_E~0); 734#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 733#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 732#L105-6 assume !(1 == ~m_pc~0); 730#L105-8 is_master_triggered_~__retres1~0 := 0; 728#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 716#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 622#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 613#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 614#L124-6 assume !(1 == ~t1_pc~0); 680#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 681#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 620#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 621#L298-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 664#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 608#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 609#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 640#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 633#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 635#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 725#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 723#L413 assume !(0 == start_simulation_~tmp~3); 702#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, 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; 626#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 627#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 678#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 679#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 673#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 579#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 580#L426 assume !(0 != start_simulation_~tmp___0~1); 662#L394-1 [2019-10-22 08:59:07,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 1 times [2019-10-22 08:59:07,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100844361] [2019-10-22 08:59:07,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,472 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2145764385, now seen corresponding path program 1 times [2019-10-22 08:59:07,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286260823] [2019-10-22 08:59:07,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:07,533 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286260823] [2019-10-22 08:59:07,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:07,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:07,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119291366] [2019-10-22 08:59:07,534 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:07,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:07,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:07,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:07,535 INFO L87 Difference]: Start difference. First operand 199 states and 289 transitions. cyclomatic complexity: 92 Second operand 5 states. [2019-10-22 08:59:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:07,623 INFO L93 Difference]: Finished difference Result 333 states and 470 transitions. [2019-10-22 08:59:07,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:59:07,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 333 states and 470 transitions. [2019-10-22 08:59:07,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 309 [2019-10-22 08:59:07,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 333 states to 333 states and 470 transitions. [2019-10-22 08:59:07,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 333 [2019-10-22 08:59:07,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 333 [2019-10-22 08:59:07,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 333 states and 470 transitions. [2019-10-22 08:59:07,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:07,638 INFO L688 BuchiCegarLoop]: Abstraction has 333 states and 470 transitions. [2019-10-22 08:59:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states and 470 transitions. [2019-10-22 08:59:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 205. [2019-10-22 08:59:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-22 08:59:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2019-10-22 08:59:07,653 INFO L711 BuchiCegarLoop]: Abstraction has 205 states and 295 transitions. [2019-10-22 08:59:07,654 INFO L591 BuchiCegarLoop]: Abstraction has 205 states and 295 transitions. [2019-10-22 08:59:07,654 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:07,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 295 transitions. [2019-10-22 08:59:07,655 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 181 [2019-10-22 08:59:07,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:07,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:07,656 INFO L849 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] [2019-10-22 08:59:07,656 INFO L850 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] [2019-10-22 08:59:07,657 INFO L791 eck$LassoCheckResult]: Stem: 1271#ULTIMATE.startENTRY ~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; 1152#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1153#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 1202#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 1203#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1272#L156-1 assume !(0 == ~M_E~0); 1218#L240-1 assume !(0 == ~T1_E~0); 1219#L245-1 assume !(0 == ~E_1~0); 1257#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 1230#L105 assume !(1 == ~m_pc~0); 1194#L105-2 is_master_triggered_~__retres1~0 := 0; 1193#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1195#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1196#L290 assume !(0 != activate_threads_~tmp~1); 1207#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1208#L124 assume !(1 == ~t1_pc~0); 1250#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 1251#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1185#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1186#L298 assume !(0 != activate_threads_~tmp___0~0); 1204#L298-2 assume !(1 == ~M_E~0); 1129#L263-1 assume !(1 == ~T1_E~0); 1130#L268-1 assume !(1 == ~E_1~0); 1209#L394-1 [2019-10-22 08:59:07,657 INFO L793 eck$LassoCheckResult]: Loop: 1209#L394-1 assume !false; 1183#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1184#L215 assume !false; 1266#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1189#L169 assume !(0 == ~m_st~0); 1191#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 1274#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1294#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 1292#L196 assume !(0 != eval_~tmp~0); 1131#L230 start_simulation_~kernel_st~0 := 2; 1132#L144-1 start_simulation_~kernel_st~0 := 3; 1199#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1237#L240-4 assume !(0 == ~T1_E~0); 1238#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1256#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 1273#L105-6 assume 1 == ~m_pc~0; 1138#L106-2 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 1140#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1143#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1144#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1161#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1162#L124-6 assume !(1 == ~t1_pc~0); 1233#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 1234#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1168#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1169#L298-6 assume 0 != activate_threads_~tmp___0~0;~t1_st~0 := 0; 1214#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 1215#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1187#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1188#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1180#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1182#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1258#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 1259#L413 assume !(0 == start_simulation_~tmp~3); 1260#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, 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; 1173#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1174#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1231#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 1232#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1224#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 1127#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 1128#L426 assume !(0 != start_simulation_~tmp___0~1); 1209#L394-1 [2019-10-22 08:59:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 2 times [2019-10-22 08:59:07,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22124352] [2019-10-22 08:59:07,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,673 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash 695328525, now seen corresponding path program 1 times [2019-10-22 08:59:07,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853457085] [2019-10-22 08:59:07,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:07,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853457085] [2019-10-22 08:59:07,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:07,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:07,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076748899] [2019-10-22 08:59:07,737 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:07,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:07,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:07,738 INFO L87 Difference]: Start difference. First operand 205 states and 295 transitions. cyclomatic complexity: 92 Second operand 5 states. [2019-10-22 08:59:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:07,831 INFO L93 Difference]: Finished difference Result 345 states and 490 transitions. [2019-10-22 08:59:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:59:07,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 490 transitions. [2019-10-22 08:59:07,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 321 [2019-10-22 08:59:07,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 345 states and 490 transitions. [2019-10-22 08:59:07,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 345 [2019-10-22 08:59:07,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 345 [2019-10-22 08:59:07,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 345 states and 490 transitions. [2019-10-22 08:59:07,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:07,837 INFO L688 BuchiCegarLoop]: Abstraction has 345 states and 490 transitions. [2019-10-22 08:59:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states and 490 transitions. [2019-10-22 08:59:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 214. [2019-10-22 08:59:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-22 08:59:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 300 transitions. [2019-10-22 08:59:07,844 INFO L711 BuchiCegarLoop]: Abstraction has 214 states and 300 transitions. [2019-10-22 08:59:07,845 INFO L591 BuchiCegarLoop]: Abstraction has 214 states and 300 transitions. [2019-10-22 08:59:07,845 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:07,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 300 transitions. [2019-10-22 08:59:07,846 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 190 [2019-10-22 08:59:07,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:07,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:07,847 INFO L849 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] [2019-10-22 08:59:07,847 INFO L850 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] [2019-10-22 08:59:07,847 INFO L791 eck$LassoCheckResult]: Stem: 1820#ULTIMATE.startENTRY ~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; 1716#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 1717#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 1765#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 1766#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 1821#L156-1 assume !(0 == ~M_E~0); 1780#L240-1 assume !(0 == ~T1_E~0); 1781#L245-1 assume !(0 == ~E_1~0); 1808#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 1789#L105 assume !(1 == ~m_pc~0); 1756#L105-2 is_master_triggered_~__retres1~0 := 0; 1755#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1757#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1758#L290 assume !(0 != activate_threads_~tmp~1); 1771#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1772#L124 assume !(1 == ~t1_pc~0); 1802#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 1803#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1748#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1749#L298 assume !(0 != activate_threads_~tmp___0~0); 1768#L298-2 assume !(1 == ~M_E~0); 1695#L263-1 assume !(1 == ~T1_E~0); 1696#L268-1 assume !(1 == ~E_1~0); 1773#L394-1 [2019-10-22 08:59:07,848 INFO L793 eck$LassoCheckResult]: Loop: 1773#L394-1 assume !false; 1862#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 1861#L215 assume !false; 1860#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1859#L169 assume !(0 == ~m_st~0); 1858#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 1856#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1854#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 1852#L196 assume !(0 != eval_~tmp~0); 1850#L230 start_simulation_~kernel_st~0 := 2; 1847#L144-1 start_simulation_~kernel_st~0 := 3; 1843#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 1841#L240-4 assume !(0 == ~T1_E~0); 1839#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 1838#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 1835#L105-6 assume !(1 == ~m_pc~0); 1831#L105-8 is_master_triggered_~__retres1~0 := 0; 1829#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 1827#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 1825#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 1823#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 1814#L124-6 assume !(1 == ~t1_pc~0); 1815#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 1902#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 1901#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 1900#L298-6 assume !(0 != activate_threads_~tmp___0~0); 1899#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 1898#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 1896#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 1894#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 1892#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1889#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1886#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 1881#L413 assume !(0 == start_simulation_~tmp~3); 1879#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, 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; 1876#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 1874#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 1872#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 1870#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1868#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 1866#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 1865#L426 assume !(0 != start_simulation_~tmp___0~1); 1773#L394-1 [2019-10-22 08:59:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 3 times [2019-10-22 08:59:07,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794975726] [2019-10-22 08:59:07,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:07,862 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:07,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:07,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1729430288, now seen corresponding path program 1 times [2019-10-22 08:59:07,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:07,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119223926] [2019-10-22 08:59:07,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:07,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:07,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119223926] [2019-10-22 08:59:07,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:07,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:07,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341812592] [2019-10-22 08:59:07,932 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:07,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:07,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:07,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:07,933 INFO L87 Difference]: Start difference. First operand 214 states and 300 transitions. cyclomatic complexity: 88 Second operand 5 states. [2019-10-22 08:59:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:08,026 INFO L93 Difference]: Finished difference Result 561 states and 769 transitions. [2019-10-22 08:59:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:59:08,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 769 transitions. [2019-10-22 08:59:08,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 516 [2019-10-22 08:59:08,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 561 states and 769 transitions. [2019-10-22 08:59:08,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2019-10-22 08:59:08,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 561 [2019-10-22 08:59:08,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 769 transitions. [2019-10-22 08:59:08,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:08,037 INFO L688 BuchiCegarLoop]: Abstraction has 561 states and 769 transitions. [2019-10-22 08:59:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 769 transitions. [2019-10-22 08:59:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 235. [2019-10-22 08:59:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-10-22 08:59:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 321 transitions. [2019-10-22 08:59:08,053 INFO L711 BuchiCegarLoop]: Abstraction has 235 states and 321 transitions. [2019-10-22 08:59:08,053 INFO L591 BuchiCegarLoop]: Abstraction has 235 states and 321 transitions. [2019-10-22 08:59:08,054 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:08,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 321 transitions. [2019-10-22 08:59:08,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 208 [2019-10-22 08:59:08,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:08,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:08,056 INFO L849 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] [2019-10-22 08:59:08,059 INFO L850 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] [2019-10-22 08:59:08,060 INFO L791 eck$LassoCheckResult]: Stem: 2621#ULTIMATE.startENTRY ~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; 2504#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 2505#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 2555#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 2556#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 2622#L156-1 assume !(0 == ~M_E~0); 2571#L240-1 assume !(0 == ~T1_E~0); 2572#L245-1 assume !(0 == ~E_1~0); 2608#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 2584#L105 assume !(1 == ~m_pc~0); 2546#L105-2 is_master_triggered_~__retres1~0 := 0; 2578#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2589#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2570#L290 assume !(0 != activate_threads_~tmp~1); 2562#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2563#L124 assume !(1 == ~t1_pc~0); 2604#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 2605#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2538#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2539#L298 assume !(0 != activate_threads_~tmp___0~0); 2557#L298-2 assume !(1 == ~M_E~0); 2483#L263-1 assume !(1 == ~T1_E~0); 2484#L268-1 assume !(1 == ~E_1~0); 2564#L394-1 [2019-10-22 08:59:08,060 INFO L793 eck$LassoCheckResult]: Loop: 2564#L394-1 assume !false; 2536#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 2537#L215 assume !false; 2616#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2624#L169 assume !(0 == ~m_st~0); 2680#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 2679#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2678#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 2677#L196 assume !(0 != eval_~tmp~0); 2481#L230 start_simulation_~kernel_st~0 := 2; 2482#L144-1 start_simulation_~kernel_st~0 := 3; 2552#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 2601#L240-4 assume !(0 == ~T1_E~0); 2660#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 2655#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 2654#L105-6 assume 1 == ~m_pc~0; 2490#L106-2 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 2492#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 2495#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 2496#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 2510#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 2511#L124-6 assume !(1 == ~t1_pc~0); 2585#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 2586#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 2520#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 2521#L298-6 assume !(0 != activate_threads_~tmp___0~0); 2569#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 2508#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 2509#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 2543#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 2533#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2535#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2609#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 2610#L413 assume !(0 == start_simulation_~tmp~3); 2612#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, 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; 2618#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 2705#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 2704#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 2626#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2577#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 2479#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 2480#L426 assume !(0 != start_simulation_~tmp___0~1); 2564#L394-1 [2019-10-22 08:59:08,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 4 times [2019-10-22 08:59:08,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292735553] [2019-10-22 08:59:08,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,079 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,083 INFO L82 PathProgramCache]: Analyzing trace with hash -893019377, now seen corresponding path program 1 times [2019-10-22 08:59:08,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011953646] [2019-10-22 08:59:08,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:08,113 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1597620181, now seen corresponding path program 1 times [2019-10-22 08:59:08,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:08,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640060758] [2019-10-22 08:59:08,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:08,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:08,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640060758] [2019-10-22 08:59:08,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:08,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:08,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448664765] [2019-10-22 08:59:08,383 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-10-22 08:59:08,469 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:08,470 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:08,474 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:08,474 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:08,474 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:59:08,474 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:08,474 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:08,474 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:08,475 INFO L131 ssoRankerPreferences]: Filename of dumped script: transmitter.01.cil.c_Iteration6_Loop [2019-10-22 08:59:08,475 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:08,475 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:08,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:08,828 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:08,829 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:08,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:59:08,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:59:08,849 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:59:08,849 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:08,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:59:08,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:59:08,857 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:59:08,857 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret3=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:08,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:59:08,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:59:08,891 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:59:08,891 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~t1_pc~0=-8} Honda state: {~t1_pc~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:08,906 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:59:08,907 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:59:08,918 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:59:08,918 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet1=0} Honda state: {ULTIMATE.start_eval_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:09,014 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:59:09,015 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:09,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:59:09,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:59:09,039 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:59:09,041 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:09,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:09,042 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:09,042 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:09,042 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:09,042 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:09,042 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:09,042 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:09,042 INFO L131 ssoRankerPreferences]: Filename of dumped script: transmitter.01.cil.c_Iteration6_Loop [2019-10-22 08:59:09,042 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:09,042 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:09,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:09,345 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:09,349 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:09,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:09,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:09,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,355 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:09,355 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:09,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:09,359 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:09,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,360 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:09,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:09,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:09,361 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,361 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:09,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,362 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:09,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,362 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:59:09,363 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:09,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:09,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,364 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:09,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,365 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:09,365 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:09,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:09,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:09,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:09,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:09,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:09,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:09,367 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:09,367 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:09,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:09,370 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:09,375 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:59:09,375 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:59:09,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:09,377 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:59:09,377 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:09,377 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~M_E~0) = -1*~M_E~0 + 1 Supporting invariants [] [2019-10-22 08:59:09,378 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:59:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:09,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:59:09,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:09,474 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:59:09,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 235 states and 321 transitions. cyclomatic complexity: 88 Second operand 5 states. [2019-10-22 08:59:09,573 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 235 states and 321 transitions. cyclomatic complexity: 88. Second operand 5 states. Result 785 states and 1080 transitions. Complement of second has 5 states. [2019-10-22 08:59:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:59:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2019-10-22 08:59:09,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 280 transitions. Stem has 23 letters. Loop has 42 letters. [2019-10-22 08:59:09,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:09,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 280 transitions. Stem has 65 letters. Loop has 42 letters. [2019-10-22 08:59:09,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:09,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 280 transitions. Stem has 23 letters. Loop has 84 letters. [2019-10-22 08:59:09,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:09,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 785 states and 1080 transitions. [2019-10-22 08:59:09,586 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 582 [2019-10-22 08:59:09,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 785 states to 785 states and 1080 transitions. [2019-10-22 08:59:09,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 610 [2019-10-22 08:59:09,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 615 [2019-10-22 08:59:09,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 785 states and 1080 transitions. [2019-10-22 08:59:09,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:09,591 INFO L688 BuchiCegarLoop]: Abstraction has 785 states and 1080 transitions. [2019-10-22 08:59:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states and 1080 transitions. [2019-10-22 08:59:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 572. [2019-10-22 08:59:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-10-22 08:59:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 787 transitions. [2019-10-22 08:59:09,602 INFO L711 BuchiCegarLoop]: Abstraction has 572 states and 787 transitions. [2019-10-22 08:59:09,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:09,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:09,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:09,603 INFO L87 Difference]: Start difference. First operand 572 states and 787 transitions. Second operand 3 states. [2019-10-22 08:59:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:09,630 INFO L93 Difference]: Finished difference Result 904 states and 1199 transitions. [2019-10-22 08:59:09,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:09,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 904 states and 1199 transitions. [2019-10-22 08:59:09,636 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 608 [2019-10-22 08:59:09,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 904 states to 904 states and 1199 transitions. [2019-10-22 08:59:09,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 636 [2019-10-22 08:59:09,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 636 [2019-10-22 08:59:09,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 904 states and 1199 transitions. [2019-10-22 08:59:09,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:09,642 INFO L688 BuchiCegarLoop]: Abstraction has 904 states and 1199 transitions. [2019-10-22 08:59:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states and 1199 transitions. [2019-10-22 08:59:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 838. [2019-10-22 08:59:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-22 08:59:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1124 transitions. [2019-10-22 08:59:09,655 INFO L711 BuchiCegarLoop]: Abstraction has 838 states and 1124 transitions. [2019-10-22 08:59:09,655 INFO L591 BuchiCegarLoop]: Abstraction has 838 states and 1124 transitions. [2019-10-22 08:59:09,655 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:59:09,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 838 states and 1124 transitions. [2019-10-22 08:59:09,659 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 564 [2019-10-22 08:59:09,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:09,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:09,660 INFO L849 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] [2019-10-22 08:59:09,660 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:09,660 INFO L791 eck$LassoCheckResult]: Stem: 5439#ULTIMATE.startENTRY ~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; 5236#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 5237#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 5311#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 5312#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 5449#L156-1 assume !(0 == ~M_E~0); 5341#L240-1 assume !(0 == ~T1_E~0); 5342#L245-1 assume !(0 == ~E_1~0); 5413#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 5363#L105 assume !(1 == ~m_pc~0); 5300#L105-2 is_master_triggered_~__retres1~0 := 0; 5354#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 5301#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 5302#L290 assume !(0 != activate_threads_~tmp~1); 5321#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5322#L124 assume !(1 == ~t1_pc~0); 5400#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 5401#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5284#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5285#L298 assume !(0 != activate_threads_~tmp___0~0); 5314#L298-2 assume !(1 == ~M_E~0); 5197#L263-1 assume !(1 == ~T1_E~0); 5198#L268-1 assume 1 == ~E_1~0;~E_1~0 := 2; 5323#L394-1 [2019-10-22 08:59:09,660 INFO L793 eck$LassoCheckResult]: Loop: 5323#L394-1 assume !false; 5986#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 5856#L215 assume !false; 5855#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5719#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5714#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5660#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 5397#L196 assume 0 != eval_~tmp~0; 5385#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 5386#L204 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 5665#L31 assume !(0 == ~m_pc~0); 5664#L34 assume 1 == ~m_pc~0; 5462#L35 assume !false; 5463#L51 ~m_pc~0 := 1;~m_st~0 := 2; 5639#L201 assume !(0 == ~t1_st~0); 5725#L215 assume !false; 5726#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5717#L169 assume !(0 == ~m_st~0); 5718#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 5807#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5805#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 5802#L196 assume !(0 != eval_~tmp~0); 5803#L230 start_simulation_~kernel_st~0 := 2; 5890#L144-1 start_simulation_~kernel_st~0 := 3; 5888#L240-2 assume 0 == ~M_E~0;~M_E~0 := 1; 5887#L240-4 assume !(0 == ~T1_E~0); 5886#L245-3 assume 0 == ~E_1~0;~E_1~0 := 1; 5885#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 5878#L105-6 assume 1 == ~m_pc~0; 5208#L106-2 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 5210#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6012#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 6011#L290-6 assume !(0 != activate_threads_~tmp~1); 5908#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 5906#L124-6 assume !(1 == ~t1_pc~0); 5904#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 5903#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 5902#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 5900#L298-6 assume !(0 != activate_threads_~tmp___0~0); 5898#L298-8 assume 1 == ~M_E~0;~M_E~0 := 2; 5733#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 5727#L268-3 assume 1 == ~E_1~0;~E_1~0 := 2; 5724#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 5721#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5707#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5706#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 5704#L413 assume !(0 == start_simulation_~tmp~3); 5434#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, 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; 5276#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 5277#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 5440#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 5992#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5991#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 5989#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 5988#L426 assume !(0 != start_simulation_~tmp___0~1); 5323#L394-1 [2019-10-22 08:59:09,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413563, now seen corresponding path program 1 times [2019-10-22 08:59:09,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555990591] [2019-10-22 08:59:09,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:09,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555990591] [2019-10-22 08:59:09,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:09,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-10-22 08:59:09,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139154868] [2019-10-22 08:59:09,689 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1663850066, now seen corresponding path program 1 times [2019-10-22 08:59:09,690 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174028588] [2019-10-22 08:59:09,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 08:59:09,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174028588] [2019-10-22 08:59:09,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:09,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:59:09,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640091792] [2019-10-22 08:59:09,741 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:09,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:09,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:09,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:09,742 INFO L87 Difference]: Start difference. First operand 838 states and 1124 transitions. cyclomatic complexity: 292 Second operand 3 states. [2019-10-22 08:59:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:09,762 INFO L93 Difference]: Finished difference Result 814 states and 1060 transitions. [2019-10-22 08:59:09,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:09,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 814 states and 1060 transitions. [2019-10-22 08:59:09,767 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 546 [2019-10-22 08:59:09,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 814 states to 814 states and 1060 transitions. [2019-10-22 08:59:09,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 574 [2019-10-22 08:59:09,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 574 [2019-10-22 08:59:09,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 814 states and 1060 transitions. [2019-10-22 08:59:09,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:09,772 INFO L688 BuchiCegarLoop]: Abstraction has 814 states and 1060 transitions. [2019-10-22 08:59:09,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states and 1060 transitions. [2019-10-22 08:59:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 814. [2019-10-22 08:59:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-10-22 08:59:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1060 transitions. [2019-10-22 08:59:09,782 INFO L711 BuchiCegarLoop]: Abstraction has 814 states and 1060 transitions. [2019-10-22 08:59:09,783 INFO L591 BuchiCegarLoop]: Abstraction has 814 states and 1060 transitions. [2019-10-22 08:59:09,783 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:59:09,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 814 states and 1060 transitions. [2019-10-22 08:59:09,786 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 546 [2019-10-22 08:59:09,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:09,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:09,787 INFO L849 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] [2019-10-22 08:59:09,787 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:09,787 INFO L791 eck$LassoCheckResult]: Stem: 7092#ULTIMATE.startENTRY ~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; 6898#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 6899#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 6972#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 6973#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 7100#L156-1 assume !(0 == ~M_E~0); 7000#L240-1 assume !(0 == ~T1_E~0); 7001#L245-1 assume !(0 == ~E_1~0); 7063#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 7024#L105 assume !(1 == ~m_pc~0); 6960#L105-2 is_master_triggered_~__retres1~0 := 0; 7010#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 6961#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 6962#L290 assume !(0 != activate_threads_~tmp~1); 6982#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 6983#L124 assume !(1 == ~t1_pc~0); 7053#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 7054#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 6950#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 6951#L298 assume !(0 != activate_threads_~tmp___0~0); 6975#L298-2 assume !(1 == ~M_E~0); 6863#L263-1 assume !(1 == ~T1_E~0); 6864#L268-1 assume !(1 == ~E_1~0); 6984#L394-1 assume !false; 7282#L395 [2019-10-22 08:59:09,787 INFO L793 eck$LassoCheckResult]: Loop: 7282#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 7522#L215 assume !false; 7519#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7516#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 7497#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7510#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 7507#L196 assume 0 != eval_~tmp~0; 7438#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 7212#L204 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 7214#L31 assume !(0 == ~m_pc~0); 7201#L34 assume 1 == ~m_pc~0; 7202#L35 assume !false; 7505#L51 ~m_pc~0 := 1;~m_st~0 := 2; 7503#L201 assume !(0 == ~t1_st~0); 7499#L215 assume !false; 7498#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7496#L169 assume !(0 == ~m_st~0); 7494#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 7493#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7492#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 7490#L196 assume !(0 != eval_~tmp~0); 7489#L230 start_simulation_~kernel_st~0 := 2; 7488#L144-1 start_simulation_~kernel_st~0 := 3; 7487#L240-2 assume !(0 == ~M_E~0); 7486#L240-4 assume !(0 == ~T1_E~0); 7283#L245-3 assume !(0 == ~E_1~0); 7485#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 7484#L105-6 assume 1 == ~m_pc~0; 7482#L106-2 assume 1 == ~M_E~0;is_master_triggered_~__retres1~0 := 1; 7481#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 7393#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 7394#L290-6 assume 0 != activate_threads_~tmp~1;~m_st~0 := 0; 7479#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 7070#L124-6 assume !(1 == ~t1_pc~0); 7071#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 7538#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 7536#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 7534#L298-6 assume !(0 != activate_threads_~tmp___0~0); 7532#L298-8 assume !(1 == ~M_E~0); 7529#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 7372#L268-3 assume !(1 == ~E_1~0); 7373#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 7366#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 7354#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7470#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 7325#L413 assume !(0 == start_simulation_~tmp~3); 7326#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, 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; 7539#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 7527#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 7537#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 7535#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 7533#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 7531#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 7530#L426 assume !(0 != start_simulation_~tmp___0~1); 7528#L394-1 assume !false; 7282#L395 [2019-10-22 08:59:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash -663180023, now seen corresponding path program 1 times [2019-10-22 08:59:09,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047595100] [2019-10-22 08:59:09,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:09,796 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:09,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash -990001554, now seen corresponding path program 1 times [2019-10-22 08:59:09,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206200545] [2019-10-22 08:59:09,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 08:59:09,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206200545] [2019-10-22 08:59:09,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:09,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:09,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81289998] [2019-10-22 08:59:09,814 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:09,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:09,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:09,814 INFO L87 Difference]: Start difference. First operand 814 states and 1060 transitions. cyclomatic complexity: 252 Second operand 3 states. [2019-10-22 08:59:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:09,846 INFO L93 Difference]: Finished difference Result 1231 states and 1561 transitions. [2019-10-22 08:59:09,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:09,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1231 states and 1561 transitions. [2019-10-22 08:59:09,854 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 748 [2019-10-22 08:59:09,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1231 states to 1171 states and 1489 transitions. [2019-10-22 08:59:09,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 798 [2019-10-22 08:59:09,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 798 [2019-10-22 08:59:09,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1171 states and 1489 transitions. [2019-10-22 08:59:09,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:09,861 INFO L688 BuchiCegarLoop]: Abstraction has 1171 states and 1489 transitions. [2019-10-22 08:59:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states and 1489 transitions. [2019-10-22 08:59:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1163. [2019-10-22 08:59:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2019-10-22 08:59:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1479 transitions. [2019-10-22 08:59:09,876 INFO L711 BuchiCegarLoop]: Abstraction has 1163 states and 1479 transitions. [2019-10-22 08:59:09,876 INFO L591 BuchiCegarLoop]: Abstraction has 1163 states and 1479 transitions. [2019-10-22 08:59:09,876 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:59:09,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1163 states and 1479 transitions. [2019-10-22 08:59:09,881 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 742 [2019-10-22 08:59:09,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:09,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:09,882 INFO L849 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] [2019-10-22 08:59:09,882 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:09,882 INFO L791 eck$LassoCheckResult]: Stem: 9148#ULTIMATE.startENTRY ~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; 8944#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 8945#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 9017#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 9018#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 9154#L156-1 assume 0 == ~M_E~0;~M_E~0 := 1; 9045#L240-1 assume !(0 == ~T1_E~0); 9046#L245-1 assume !(0 == ~E_1~0); 9164#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 9165#L105 assume !(1 == ~m_pc~0); 9060#L105-2 is_master_triggered_~__retres1~0 := 0; 9061#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 9007#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 9008#L290 assume !(0 != activate_threads_~tmp~1); 9024#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 9025#L124 assume !(1 == ~t1_pc~0); 9112#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 9113#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 8996#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 8997#L298 assume !(0 != activate_threads_~tmp___0~0); 9019#L298-2 assume 1 == ~M_E~0;~M_E~0 := 2; 8914#L263-1 assume !(1 == ~T1_E~0); 8915#L268-1 assume !(1 == ~E_1~0); 9026#L394-1 assume !false; 8992#L395 [2019-10-22 08:59:09,883 INFO L793 eck$LassoCheckResult]: Loop: 8992#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 8993#L215 assume !false; 10029#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9703#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 9701#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9699#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 9697#L196 assume 0 != eval_~tmp~0; 9695#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 9681#L204 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 9693#L31 assume !(0 == ~m_pc~0); 9687#L34 assume 1 == ~m_pc~0; 9684#L35 assume !false; 9682#L51 ~m_pc~0 := 1;~m_st~0 := 2; 9679#L201 assume !(0 == ~t1_st~0); 9677#L215 assume !false; 10027#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10028#L169 assume !(0 == ~m_st~0); 10037#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 10035#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 9997#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 9998#L196 assume !(0 != eval_~tmp~0); 8910#L230 start_simulation_~kernel_st~0 := 2; 8911#L144-1 start_simulation_~kernel_st~0 := 3; 9011#L240-2 assume !(0 == ~M_E~0); 9092#L240-4 assume !(0 == ~T1_E~0); 9093#L245-3 assume !(0 == ~E_1~0); 9118#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 9100#L105-6 assume !(1 == ~m_pc~0); 8921#L105-8 is_master_triggered_~__retres1~0 := 0; 9946#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 9944#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 9942#L290-6 assume !(0 != activate_threads_~tmp~1); 9938#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 9936#L124-6 assume !(1 == ~t1_pc~0); 9933#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 9932#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 9925#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 9043#L298-6 assume !(0 != activate_threads_~tmp___0~0); 9031#L298-8 assume !(1 == ~M_E~0); 9032#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 9483#L268-3 assume !(1 == ~E_1~0); 9464#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 9465#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 9468#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10039#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 9129#L413 assume !(0 == start_simulation_~tmp~3); 9130#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, 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; 8976#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 8977#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10041#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 9171#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 9057#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 9058#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 9167#L426 assume !(0 != start_simulation_~tmp___0~1); 9168#L394-1 assume !false; 8992#L395 [2019-10-22 08:59:09,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1025704137, now seen corresponding path program 1 times [2019-10-22 08:59:09,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658571326] [2019-10-22 08:59:09,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:09,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658571326] [2019-10-22 08:59:09,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:09,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:09,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174960440] [2019-10-22 08:59:09,901 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:09,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1432454069, now seen corresponding path program 1 times [2019-10-22 08:59:09,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855084052] [2019-10-22 08:59:09,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:09,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855084052] [2019-10-22 08:59:09,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:09,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:09,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415440592] [2019-10-22 08:59:09,929 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:09,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:09,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:09,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:09,930 INFO L87 Difference]: Start difference. First operand 1163 states and 1479 transitions. cyclomatic complexity: 324 Second operand 3 states. [2019-10-22 08:59:09,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:09,949 INFO L93 Difference]: Finished difference Result 700 states and 871 transitions. [2019-10-22 08:59:09,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:09,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 871 transitions. [2019-10-22 08:59:09,953 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 476 [2019-10-22 08:59:09,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 501 states and 623 transitions. [2019-10-22 08:59:09,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 501 [2019-10-22 08:59:09,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 501 [2019-10-22 08:59:09,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 501 states and 623 transitions. [2019-10-22 08:59:09,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:09,957 INFO L688 BuchiCegarLoop]: Abstraction has 501 states and 623 transitions. [2019-10-22 08:59:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states and 623 transitions. [2019-10-22 08:59:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 301. [2019-10-22 08:59:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-10-22 08:59:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 371 transitions. [2019-10-22 08:59:09,962 INFO L711 BuchiCegarLoop]: Abstraction has 301 states and 371 transitions. [2019-10-22 08:59:09,962 INFO L591 BuchiCegarLoop]: Abstraction has 301 states and 371 transitions. [2019-10-22 08:59:09,962 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:59:09,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 371 transitions. [2019-10-22 08:59:09,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 277 [2019-10-22 08:59:09,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:09,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:09,964 INFO L849 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] [2019-10-22 08:59:09,965 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:09,966 INFO L791 eck$LassoCheckResult]: Stem: 10912#ULTIMATE.startENTRY ~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; 10798#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 10799#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 10844#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 10845#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 10917#L156-1 assume !(0 == ~M_E~0); 10861#L240-1 assume !(0 == ~T1_E~0); 10862#L245-1 assume !(0 == ~E_1~0); 10900#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 10878#L105 assume !(1 == ~m_pc~0); 10834#L105-2 is_master_triggered_~__retres1~0 := 0; 10870#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 10835#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10836#L290 assume !(0 != activate_threads_~tmp~1); 10853#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 10854#L124 assume !(1 == ~t1_pc~0); 10895#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 10896#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 10828#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10829#L298 assume !(0 != activate_threads_~tmp___0~0); 10847#L298-2 assume !(1 == ~M_E~0); 10780#L263-1 assume !(1 == ~T1_E~0); 10781#L268-1 assume !(1 == ~E_1~0); 10855#L394-1 [2019-10-22 08:59:09,966 INFO L793 eck$LassoCheckResult]: Loop: 10855#L394-1 assume !false; 11038#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 11012#L215 assume !false; 10924#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10831#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 10832#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11068#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 10893#L196 assume 0 != eval_~tmp~0; 10894#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 10982#L204 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 10980#L31 assume !(0 == ~m_pc~0); 10978#L34 assume 1 == ~m_pc~0; 10979#L35 assume !false; 10788#L51 ~m_pc~0 := 1;~m_st~0 := 2; 10789#L201 assume !(0 == ~t1_st~0); 10827#L215 assume !false; 10909#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10995#L169 assume !(0 == ~m_st~0); 10988#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 10987#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10986#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 10984#L196 assume !(0 != eval_~tmp~0); 10981#L230 start_simulation_~kernel_st~0 := 2; 10976#L144-1 start_simulation_~kernel_st~0 := 3; 10974#L240-2 assume !(0 == ~M_E~0); 10971#L240-4 assume !(0 == ~T1_E~0); 10967#L245-3 assume !(0 == ~E_1~0); 10963#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 10956#L105-6 assume !(1 == ~m_pc~0); 10948#L105-8 is_master_triggered_~__retres1~0 := 0; 10942#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 10790#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 10791#L290-6 assume !(0 != activate_threads_~tmp~1); 10804#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 10805#L124-6 assume !(1 == ~t1_pc~0); 10879#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 10880#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 10812#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 10813#L298-6 assume !(0 != activate_threads_~tmp___0~0); 10858#L298-8 assume !(1 == ~M_E~0); 10802#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 10803#L268-3 assume !(1 == ~E_1~0); 10830#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 10823#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 10825#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11069#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 10905#L413 assume !(0 == start_simulation_~tmp~3); 10906#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, 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; 10819#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 10820#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 10881#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 10882#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 10869#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 10776#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 10777#L426 assume !(0 != start_simulation_~tmp___0~1); 10855#L394-1 [2019-10-22 08:59:09,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1545413561, now seen corresponding path program 5 times [2019-10-22 08:59:09,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138095819] [2019-10-22 08:59:09,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:09,978 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:09,983 INFO L82 PathProgramCache]: Analyzing trace with hash 46950099, now seen corresponding path program 2 times [2019-10-22 08:59:09,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:09,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420451393] [2019-10-22 08:59:09,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:09,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:09,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420451393] [2019-10-22 08:59:09,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:09,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:09,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25219204] [2019-10-22 08:59:10,000 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:10,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:10,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:10,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:10,000 INFO L87 Difference]: Start difference. First operand 301 states and 371 transitions. cyclomatic complexity: 72 Second operand 3 states. [2019-10-22 08:59:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:10,018 INFO L93 Difference]: Finished difference Result 358 states and 433 transitions. [2019-10-22 08:59:10,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:10,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 358 states and 433 transitions. [2019-10-22 08:59:10,020 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 251 [2019-10-22 08:59:10,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 358 states to 358 states and 433 transitions. [2019-10-22 08:59:10,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 358 [2019-10-22 08:59:10,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2019-10-22 08:59:10,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 358 states and 433 transitions. [2019-10-22 08:59:10,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:10,022 INFO L688 BuchiCegarLoop]: Abstraction has 358 states and 433 transitions. [2019-10-22 08:59:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states and 433 transitions. [2019-10-22 08:59:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 328. [2019-10-22 08:59:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-22 08:59:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 400 transitions. [2019-10-22 08:59:10,029 INFO L711 BuchiCegarLoop]: Abstraction has 328 states and 400 transitions. [2019-10-22 08:59:10,029 INFO L591 BuchiCegarLoop]: Abstraction has 328 states and 400 transitions. [2019-10-22 08:59:10,029 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:59:10,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 400 transitions. [2019-10-22 08:59:10,030 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 251 [2019-10-22 08:59:10,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:10,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:10,031 INFO L849 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] [2019-10-22 08:59:10,031 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:10,031 INFO L791 eck$LassoCheckResult]: Stem: 11588#ULTIMATE.startENTRY ~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; 11463#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 11464#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 11508#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 11509#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 11593#L156-1 assume !(0 == ~M_E~0); 11525#L240-1 assume !(0 == ~T1_E~0); 11526#L245-1 assume !(0 == ~E_1~0); 11573#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 11542#L105 assume 1 == ~m_pc~0; 11497#L106 assume !(1 == ~M_E~0); 11498#L105-2 is_master_triggered_~__retres1~0 := 0; 11547#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 11499#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 11500#L290 assume !(0 != activate_threads_~tmp~1); 11521#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 11567#L124 assume !(1 == ~t1_pc~0); 11568#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 11569#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 11492#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 11493#L298 assume !(0 != activate_threads_~tmp___0~0); 11511#L298-2 assume !(1 == ~M_E~0); 11443#L263-1 assume !(1 == ~T1_E~0); 11444#L268-1 assume !(1 == ~E_1~0); 11516#L394-1 [2019-10-22 08:59:10,031 INFO L793 eck$LassoCheckResult]: Loop: 11516#L394-1 assume !false; 11759#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 11758#L215 assume !false; 11754#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11753#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 11723#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11578#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 11579#L196 assume 0 != eval_~tmp~0; 11752#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 11580#L204 assume 0 != eval_~tmp_ndt_1~0;~m_st~0 := 1; 11582#L31 assume !(0 == ~m_pc~0); 11522#L34 assume 1 == ~m_pc~0; 11507#L35 assume !false; 11455#L51 ~m_pc~0 := 1;~m_st~0 := 2; 11456#L201 assume !(0 == ~t1_st~0); 11528#L215 assume !false; 11724#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11722#L169 assume !(0 == ~m_st~0); 11595#L173 assume !(0 == ~t1_st~0);exists_runnable_thread_~__retres1~2 := 0; 11597#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11671#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 11660#L196 assume !(0 != eval_~tmp~0); 11661#L230 start_simulation_~kernel_st~0 := 2; 11504#L144-1 start_simulation_~kernel_st~0 := 3; 11505#L240-2 assume !(0 == ~M_E~0); 11554#L240-4 assume !(0 == ~T1_E~0); 11555#L245-3 assume !(0 == ~E_1~0); 11570#L250-3 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 11556#L105-6 assume 1 == ~m_pc~0; 11451#L106-2 assume !(1 == ~M_E~0); 11452#L105-8 is_master_triggered_~__retres1~0 := 0; 11535#L116-2 is_master_triggered_#res := is_master_triggered_~__retres1~0; 11453#L117-2 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 11454#L290-6 assume !(0 != activate_threads_~tmp~1); 11469#L290-8 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 11470#L124-6 assume !(1 == ~t1_pc~0); 11543#L124-8 is_transmit1_triggered_~__retres1~1 := 0; 11544#L135-2 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 11477#L136-2 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 11478#L298-6 assume !(0 != activate_threads_~tmp___0~0); 11520#L298-8 assume !(1 == ~M_E~0); 11467#L263-3 assume 1 == ~T1_E~0;~T1_E~0 := 2; 11468#L268-3 assume !(1 == ~E_1~0); 11494#L273-3 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 11695#L169-1 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 11696#L181-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11735#L182-1 start_simulation_#t~ret6 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret6;havoc start_simulation_#t~ret6; 11687#L413 assume !(0 == start_simulation_~tmp~3); 11583#L413-1 havoc stop_simulation_#res;havoc stop_simulation_#t~ret5, 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; 11584#L169-2 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 11589#L181-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 11590#L182-2 stop_simulation_#t~ret5 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret5;havoc stop_simulation_#t~ret5; 11764#L368 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11763#L375 stop_simulation_#res := stop_simulation_~__retres2~0; 11762#L376 start_simulation_#t~ret7 := stop_simulation_#res;start_simulation_~tmp___0~1 := start_simulation_#t~ret7;havoc start_simulation_#t~ret7; 11761#L426 assume !(0 != start_simulation_~tmp___0~1); 11516#L394-1 [2019-10-22 08:59:10,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,031 INFO L82 PathProgramCache]: Analyzing trace with hash 379540498, now seen corresponding path program 1 times [2019-10-22 08:59:10,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955219271] [2019-10-22 08:59:10,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:10,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955219271] [2019-10-22 08:59:10,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:10,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:10,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245804897] [2019-10-22 08:59:10,044 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1425347569, now seen corresponding path program 1 times [2019-10-22 08:59:10,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577458371] [2019-10-22 08:59:10,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:59:10,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577458371] [2019-10-22 08:59:10,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:10,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:10,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623029231] [2019-10-22 08:59:10,070 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:10,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:10,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:10,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:10,071 INFO L87 Difference]: Start difference. First operand 328 states and 400 transitions. cyclomatic complexity: 76 Second operand 3 states. [2019-10-22 08:59:10,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:10,086 INFO L93 Difference]: Finished difference Result 316 states and 382 transitions. [2019-10-22 08:59:10,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:10,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 382 transitions. [2019-10-22 08:59:10,088 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 251 [2019-10-22 08:59:10,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 316 states and 382 transitions. [2019-10-22 08:59:10,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2019-10-22 08:59:10,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2019-10-22 08:59:10,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 382 transitions. [2019-10-22 08:59:10,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:10,091 INFO L688 BuchiCegarLoop]: Abstraction has 316 states and 382 transitions. [2019-10-22 08:59:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states and 382 transitions. [2019-10-22 08:59:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 312. [2019-10-22 08:59:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-10-22 08:59:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 378 transitions. [2019-10-22 08:59:10,095 INFO L711 BuchiCegarLoop]: Abstraction has 312 states and 378 transitions. [2019-10-22 08:59:10,095 INFO L591 BuchiCegarLoop]: Abstraction has 312 states and 378 transitions. [2019-10-22 08:59:10,095 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:59:10,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 312 states and 378 transitions. [2019-10-22 08:59:10,096 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 251 [2019-10-22 08:59:10,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:10,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:10,097 INFO L849 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] [2019-10-22 08:59:10,097 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:10,097 INFO L791 eck$LassoCheckResult]: Stem: 12228#ULTIMATE.startENTRY ~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; 12112#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 12113#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 12156#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 12157#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 12231#L156-1 assume !(0 == ~M_E~0); 12170#L240-1 assume !(0 == ~T1_E~0); 12171#L245-1 assume !(0 == ~E_1~0); 12215#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 12187#L105 assume !(1 == ~m_pc~0); 12179#L105-2 is_master_triggered_~__retres1~0 := 0; 12180#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 12147#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 12148#L290 assume !(0 != activate_threads_~tmp~1); 12163#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 12164#L124 assume !(1 == ~t1_pc~0); 12208#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 12209#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 12137#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 12138#L298 assume !(0 != activate_threads_~tmp___0~0); 12158#L298-2 assume !(1 == ~M_E~0); 12094#L263-1 assume !(1 == ~T1_E~0); 12095#L268-1 assume !(1 == ~E_1~0); 12165#L394-1 assume !false; 12285#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 12280#L215 [2019-10-22 08:59:10,097 INFO L793 eck$LassoCheckResult]: Loop: 12280#L215 assume !false; 12276#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 12273#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 12270#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 12266#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 12263#L196 assume 0 != eval_~tmp~0; 12261#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 12258#L204 assume !(0 != eval_~tmp_ndt_1~0); 12259#L201 assume !(0 == ~t1_st~0); 12280#L215 [2019-10-22 08:59:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,098 INFO L82 PathProgramCache]: Analyzing trace with hash 916255881, now seen corresponding path program 1 times [2019-10-22 08:59:10,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062321948] [2019-10-22 08:59:10,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,107 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:10,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1324144305, now seen corresponding path program 1 times [2019-10-22 08:59:10,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551336998] [2019-10-22 08:59:10,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,121 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1901692119, now seen corresponding path program 1 times [2019-10-22 08:59:10,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155915067] [2019-10-22 08:59:10,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,124 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:10,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155915067] [2019-10-22 08:59:10,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:10,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:10,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687757353] [2019-10-22 08:59:10,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:10,174 INFO L87 Difference]: Start difference. First operand 312 states and 378 transitions. cyclomatic complexity: 70 Second operand 3 states. [2019-10-22 08:59:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:10,206 INFO L93 Difference]: Finished difference Result 522 states and 619 transitions. [2019-10-22 08:59:10,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:10,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 522 states and 619 transitions. [2019-10-22 08:59:10,208 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 357 [2019-10-22 08:59:10,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 522 states to 522 states and 619 transitions. [2019-10-22 08:59:10,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2019-10-22 08:59:10,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 522 [2019-10-22 08:59:10,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 619 transitions. [2019-10-22 08:59:10,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:10,211 INFO L688 BuchiCegarLoop]: Abstraction has 522 states and 619 transitions. [2019-10-22 08:59:10,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 619 transitions. [2019-10-22 08:59:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 458. [2019-10-22 08:59:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-22 08:59:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 545 transitions. [2019-10-22 08:59:10,218 INFO L711 BuchiCegarLoop]: Abstraction has 458 states and 545 transitions. [2019-10-22 08:59:10,218 INFO L591 BuchiCegarLoop]: Abstraction has 458 states and 545 transitions. [2019-10-22 08:59:10,218 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 08:59:10,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 458 states and 545 transitions. [2019-10-22 08:59:10,219 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 333 [2019-10-22 08:59:10,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:10,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:10,220 INFO L849 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] [2019-10-22 08:59:10,220 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:10,220 INFO L791 eck$LassoCheckResult]: Stem: 13075#ULTIMATE.startENTRY ~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; 12954#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 12955#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 12998#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 12999#L151-1 assume !(1 == ~t1_i~0);~t1_st~0 := 2; 13079#L156-1 assume !(0 == ~M_E~0); 13015#L240-1 assume !(0 == ~T1_E~0); 13016#L245-1 assume !(0 == ~E_1~0); 13276#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 13274#L105 assume !(1 == ~m_pc~0); 13271#L105-2 is_master_triggered_~__retres1~0 := 0; 13270#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 13269#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 13011#L290 assume !(0 != activate_threads_~tmp~1); 13012#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 13054#L124 assume !(1 == ~t1_pc~0); 13055#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 13056#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 13057#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 13035#L298 assume !(0 != activate_threads_~tmp___0~0); 13036#L298-2 assume !(1 == ~M_E~0); 12936#L263-1 assume !(1 == ~T1_E~0); 12937#L268-1 assume !(1 == ~E_1~0); 13258#L394-1 assume !false; 13233#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 13234#L215 [2019-10-22 08:59:10,220 INFO L793 eck$LassoCheckResult]: Loop: 13234#L215 assume !false; 13211#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13212#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 13208#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13207#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 13206#L196 assume 0 != eval_~tmp~0; 13205#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 13202#L204 assume !(0 != eval_~tmp_ndt_1~0); 13203#L201 assume !(0 == ~t1_st~0); 13234#L215 [2019-10-22 08:59:10,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1338957707, now seen corresponding path program 1 times [2019-10-22 08:59:10,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553816416] [2019-10-22 08:59:10,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:10,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553816416] [2019-10-22 08:59:10,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:10,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:10,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376321526] [2019-10-22 08:59:10,231 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:10,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1324144305, now seen corresponding path program 2 times [2019-10-22 08:59:10,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059181246] [2019-10-22 08:59:10,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:10,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:10,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:10,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:10,271 INFO L87 Difference]: Start difference. First operand 458 states and 545 transitions. cyclomatic complexity: 92 Second operand 3 states. [2019-10-22 08:59:10,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:10,276 INFO L93 Difference]: Finished difference Result 297 states and 355 transitions. [2019-10-22 08:59:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:10,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 297 states and 355 transitions. [2019-10-22 08:59:10,278 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 221 [2019-10-22 08:59:10,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 297 states to 297 states and 355 transitions. [2019-10-22 08:59:10,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 297 [2019-10-22 08:59:10,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 297 [2019-10-22 08:59:10,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 297 states and 355 transitions. [2019-10-22 08:59:10,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:10,281 INFO L688 BuchiCegarLoop]: Abstraction has 297 states and 355 transitions. [2019-10-22 08:59:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 355 transitions. [2019-10-22 08:59:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2019-10-22 08:59:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-22 08:59:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 355 transitions. [2019-10-22 08:59:10,287 INFO L711 BuchiCegarLoop]: Abstraction has 297 states and 355 transitions. [2019-10-22 08:59:10,287 INFO L591 BuchiCegarLoop]: Abstraction has 297 states and 355 transitions. [2019-10-22 08:59:10,287 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 08:59:10,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 297 states and 355 transitions. [2019-10-22 08:59:10,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 221 [2019-10-22 08:59:10,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:10,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:10,288 INFO L849 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] [2019-10-22 08:59:10,288 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:10,288 INFO L791 eck$LassoCheckResult]: Stem: 13814#ULTIMATE.startENTRY ~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; 13715#L-1 havoc main_#res;havoc main_~__retres1~3;havoc main_~__retres1~3;~m_i~0 := 1;~t1_i~0 := 1; 13716#L357 havoc start_simulation_#t~ret6, start_simulation_#t~ret7, 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; 13758#L144 assume 1 == ~m_i~0;~m_st~0 := 0; 13759#L151-1 assume 1 == ~t1_i~0;~t1_st~0 := 0; 13819#L156-1 assume !(0 == ~M_E~0); 13771#L240-1 assume !(0 == ~T1_E~0); 13772#L245-1 assume !(0 == ~E_1~0); 13803#L250-1 havoc activate_threads_#t~ret3, activate_threads_#t~ret4, 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; 13783#L105 assume !(1 == ~m_pc~0); 13778#L105-2 is_master_triggered_~__retres1~0 := 0; 13779#L116 is_master_triggered_#res := is_master_triggered_~__retres1~0; 13750#L117 activate_threads_#t~ret3 := is_master_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret3;havoc activate_threads_#t~ret3; 13751#L290 assume !(0 != activate_threads_~tmp~1); 13763#L290-2 havoc is_transmit1_triggered_#res;havoc is_transmit1_triggered_~__retres1~1;havoc is_transmit1_triggered_~__retres1~1; 13764#L124 assume !(1 == ~t1_pc~0); 13798#L124-2 is_transmit1_triggered_~__retres1~1 := 0; 13799#L135 is_transmit1_triggered_#res := is_transmit1_triggered_~__retres1~1; 13740#L136 activate_threads_#t~ret4 := is_transmit1_triggered_#res;activate_threads_~tmp___0~0 := activate_threads_#t~ret4;havoc activate_threads_#t~ret4; 13741#L298 assume !(0 != activate_threads_~tmp___0~0); 13760#L298-2 assume !(1 == ~M_E~0); 13697#L263-1 assume !(1 == ~T1_E~0); 13698#L268-1 assume !(1 == ~E_1~0); 13765#L394-1 assume !false; 13742#L395 start_simulation_~kernel_st~0 := 1;havoc eval_#t~ret0, eval_#t~nondet1, eval_~tmp_ndt_1~0, eval_#t~nondet2, eval_~tmp_ndt_2~0, eval_~tmp~0;havoc eval_~tmp~0; 13743#L215 [2019-10-22 08:59:10,289 INFO L793 eck$LassoCheckResult]: Loop: 13743#L215 assume !false; 13977#L192 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~2;havoc exists_runnable_thread_~__retres1~2; 13976#L169 assume 0 == ~m_st~0;exists_runnable_thread_~__retres1~2 := 1; 13973#L181 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~2; 13971#L182 eval_#t~ret0 := exists_runnable_thread_#res;eval_~tmp~0 := eval_#t~ret0;havoc eval_#t~ret0; 13970#L196 assume 0 != eval_~tmp~0; 13969#L196-1 assume 0 == ~m_st~0;havoc eval_~tmp_ndt_1~0;eval_~tmp_ndt_1~0 := eval_#t~nondet1;havoc eval_#t~nondet1; 13809#L204 assume !(0 != eval_~tmp_ndt_1~0); 13802#L201 assume 0 == ~t1_st~0;havoc eval_~tmp_ndt_2~0;eval_~tmp_ndt_2~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 13773#L218 assume !(0 != eval_~tmp_ndt_2~0); 13743#L215 [2019-10-22 08:59:10,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,289 INFO L82 PathProgramCache]: Analyzing trace with hash 916255881, now seen corresponding path program 2 times [2019-10-22 08:59:10,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170057616] [2019-10-22 08:59:10,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,297 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:10,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1901200370, now seen corresponding path program 1 times [2019-10-22 08:59:10,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669378230] [2019-10-22 08:59:10,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,305 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1177085590, now seen corresponding path program 1 times [2019-10-22 08:59:10,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:10,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543693222] [2019-10-22 08:59:10,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:10,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:10,318 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:10,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:10 BoogieIcfgContainer [2019-10-22 08:59:10,508 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:10,508 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:10,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:10,509 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:10,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:06" (3/4) ... [2019-10-22 08:59:10,513 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 08:59:10,560 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f0b3a49d-f27e-480a-8d38-73593040c361/bin/uautomizer/witness.graphml [2019-10-22 08:59:10,560 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:10,562 INFO L168 Benchmark]: Toolchain (without parser) took 4772.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 225.4 MB). Free memory was 944.5 MB in the beginning and 869.6 MB in the end (delta: 74.9 MB). Peak memory consumption was 300.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:10,563 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:10,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:10,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:10,564 INFO L168 Benchmark]: Boogie Preprocessor took 29.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:10,564 INFO L168 Benchmark]: RCFGBuilder took 697.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:10,565 INFO L168 Benchmark]: BuchiAutomizer took 3614.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 880.3 MB in the end (delta: 214.2 MB). Peak memory consumption was 291.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:10,565 INFO L168 Benchmark]: Witness Printer took 52.21 ms. Allocated memory is still 1.3 GB. Free memory was 880.3 MB in the beginning and 869.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:10,575 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 697.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3614.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.6 MB). Free memory was 1.1 GB in the beginning and 880.3 MB in the end (delta: 214.2 MB). Peak memory consumption was 291.7 MB. Max. memory is 11.5 GB. * Witness Printer took 52.21 ms. Allocated memory is still 1.3 GB. Free memory was 880.3 MB in the beginning and 869.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (13 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * M_E + 1 and consists of 3 locations. 13 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 297 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 14 iterations. TraceHistogramMax:2. Analysis of lassos took 2.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 1174 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1163 states and ocurred in iteration 8. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2521 SDtfs, 2475 SDslu, 2610 SDs, 0 SdLazy, 263 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc1 concLT1 SILN1 SILU0 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital83 mio100 ax100 hnf100 lsp13 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf120 smp100 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 191]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42183e25=0, \result=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69209c9a=0, tmp=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@512317a9=0, kernel_st=1, __retres1=0, tmp___0=0, t1_pc=0, __retres1=1, T1_E=2, \result=0, E_1=2, tmp_ndt_1=0, M_E=2, tmp_ndt_2=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ea60155=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@26ea8b7e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@71f33139=0, m_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bf60a3e=0, t1_st=0, m_st=0, tmp___0=0, tmp=0, __retres1=0, t1_i=1, m_pc=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 191]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; [L439] int __retres1 ; [L354] m_i = 1 [L355] t1_i = 1 [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 [L151] COND TRUE m_i == 1 [L152] m_st = 0 [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 [L240] COND FALSE !(M_E == 0) [L245] COND FALSE !(T1_E == 0) [L250] COND FALSE !(E_1 == 0) [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; [L105] COND FALSE !(m_pc == 1) [L115] __retres1 = 0 [L117] return (__retres1); [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) [L121] int __retres1 ; [L124] COND FALSE !(t1_pc == 1) [L134] __retres1 = 0 [L136] return (__retres1); [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) [L263] COND FALSE !(M_E == 1) [L268] COND FALSE !(T1_E == 1) [L273] COND FALSE !(E_1 == 1) [L394] COND TRUE 1 [L397] kernel_st = 1 [L187] int tmp ; Loop: [L191] COND TRUE 1 [L166] int __retres1 ; [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 [L182] return (__retres1); [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND FALSE !(\read(tmp_ndt_2)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...