./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 518acce2d3c6fcf7f85ccd842b876047f6f96eecf9e5395ea8bbd2907cbf9fc2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:41:05,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:41:05,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:41:05,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:41:05,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:41:05,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:41:05,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:41:05,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:41:05,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:41:05,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:41:05,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:41:05,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:41:05,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:41:05,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:41:05,660 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:41:05,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:41:05,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:41:05,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:41:05,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:41:05,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:41:05,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:41:05,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:41:05,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:41:05,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:41:05,693 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:41:05,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:41:05,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:41:05,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:41:05,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:41:05,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:41:05,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:41:05,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:41:05,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:41:05,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:41:05,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:41:05,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:41:05,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:41:05,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:41:05,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:41:05,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:41:05,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:41:05,712 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 19:41:05,753 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:41:05,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:41:05,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:41:05,754 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:41:05,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:41:05,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:41:05,756 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:41:05,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:41:05,757 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:41:05,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:41:05,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:41:05,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:41:05,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 19:41:05,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:41:05,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 19:41:05,759 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:41:05,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:41:05,759 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:41:05,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 19:41:05,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:41:05,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:41:05,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:41:05,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:41:05,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:41:05,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:41:05,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 19:41:05,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:41:05,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:41:05,762 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 19:41:05,763 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 19:41:05,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 19:41:05,764 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:41:05,764 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be 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(G ! call(reach_error())) ) 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 -> 518acce2d3c6fcf7f85ccd842b876047f6f96eecf9e5395ea8bbd2907cbf9fc2 [2021-10-21 19:41:06,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:41:06,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:41:06,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:41:06,103 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:41:06,104 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:41:06,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-21 19:41:06,171 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/data/b601010f7/8e36f6a9dada47f684f918b9ebae01ac/FLAG50625310d [2021-10-21 19:41:06,719 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:41:06,720 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-21 19:41:06,737 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/data/b601010f7/8e36f6a9dada47f684f918b9ebae01ac/FLAG50625310d [2021-10-21 19:41:07,062 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/data/b601010f7/8e36f6a9dada47f684f918b9ebae01ac [2021-10-21 19:41:07,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:41:07,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:41:07,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:41:07,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:41:07,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:41:07,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3197cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07, skipping insertion in model container [2021-10-21 19:41:07,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:41:07,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:41:07,319 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-21 19:41:07,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:41:07,418 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:41:07,431 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-21 19:41:07,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:41:07,502 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:41:07,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07 WrapperNode [2021-10-21 19:41:07,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:41:07,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:41:07,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:41:07,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:41:07,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:41:07,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:41:07,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:41:07,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:41:07,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:41:07,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:41:07,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:41:07,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:41:07,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07" (1/1) ... [2021-10-21 19:41:07,598 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:41:07,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:41:07,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:41:07,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:41:07,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:41:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:41:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:41:07,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:41:08,215 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:41:08,215 INFO L299 CfgBuilder]: Removed 80 assume(true) statements. [2021-10-21 19:41:08,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:41:08 BoogieIcfgContainer [2021-10-21 19:41:08,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:41:08,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:41:08,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:41:08,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:41:08,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:41:07" (1/3) ... [2021-10-21 19:41:08,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235a0adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:41:08, skipping insertion in model container [2021-10-21 19:41:08,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:41:07" (2/3) ... [2021-10-21 19:41:08,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235a0adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:41:08, skipping insertion in model container [2021-10-21 19:41:08,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:41:08" (3/3) ... [2021-10-21 19:41:08,243 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-10-21 19:41:08,248 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:41:08,248 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-21 19:41:08,295 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:41:08,302 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 19:41:08,302 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-21 19:41:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.5755395683453237) internal successors, (219), 140 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:41:08,327 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:08,328 INFO L512 BasicCegarLoop]: trace 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] [2021-10-21 19:41:08,328 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2021-10-21 19:41:08,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:08,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097376142] [2021-10-21 19:41:08,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:08,344 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:41:08,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:08,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097376142] [2021-10-21 19:41:08,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097376142] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:08,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:08,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:41:08,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12043377] [2021-10-21 19:41:08,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:41:08,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:08,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:41:08,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:08,563 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.5755395683453237) internal successors, (219), 140 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:08,612 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2021-10-21 19:41:08,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:41:08,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-21 19:41:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:08,624 INFO L225 Difference]: With dead ends: 277 [2021-10-21 19:41:08,624 INFO L226 Difference]: Without dead ends: 137 [2021-10-21 19:41:08,627 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-21 19:41:08,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-10-21 19:41:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.5073529411764706) internal successors, (205), 136 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2021-10-21 19:41:08,675 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2021-10-21 19:41:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:08,676 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2021-10-21 19:41:08,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2021-10-21 19:41:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:41:08,678 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:08,678 INFO L512 BasicCegarLoop]: trace 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] [2021-10-21 19:41:08,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:41:08,679 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:08,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2021-10-21 19:41:08,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:08,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140842377] [2021-10-21 19:41:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:08,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:41:08,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:08,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140842377] [2021-10-21 19:41:08,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140842377] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:08,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:08,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:41:08,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637304165] [2021-10-21 19:41:08,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:41:08,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:08,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:41:08,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:08,733 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:08,837 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2021-10-21 19:41:08,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:41:08,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-21 19:41:08,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:08,840 INFO L225 Difference]: With dead ends: 363 [2021-10-21 19:41:08,840 INFO L226 Difference]: Without dead ends: 232 [2021-10-21 19:41:08,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-10-21 19:41:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2021-10-21 19:41:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4890829694323144) internal successors, (341), 229 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2021-10-21 19:41:08,897 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2021-10-21 19:41:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:08,898 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2021-10-21 19:41:08,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2021-10-21 19:41:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:41:08,899 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:08,900 INFO L512 BasicCegarLoop]: trace 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] [2021-10-21 19:41:08,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:41:08,900 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:08,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2021-10-21 19:41:08,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:08,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112590800] [2021-10-21 19:41:08,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:08,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:41:08,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:08,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112590800] [2021-10-21 19:41:08,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112590800] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:08,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:08,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:41:08,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896345300] [2021-10-21 19:41:08,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:41:08,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:08,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:41:08,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:08,982 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:09,055 INFO L93 Difference]: Finished difference Result 453 states and 673 transitions. [2021-10-21 19:41:09,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:41:09,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-21 19:41:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:09,058 INFO L225 Difference]: With dead ends: 453 [2021-10-21 19:41:09,059 INFO L226 Difference]: Without dead ends: 230 [2021-10-21 19:41:09,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-21 19:41:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-10-21 19:41:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4541484716157205) internal successors, (333), 229 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 333 transitions. [2021-10-21 19:41:09,088 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 333 transitions. Word has length 39 [2021-10-21 19:41:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:09,089 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 333 transitions. [2021-10-21 19:41:09,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,089 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 333 transitions. [2021-10-21 19:41:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:41:09,091 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:09,091 INFO L512 BasicCegarLoop]: trace 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] [2021-10-21 19:41:09,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:41:09,092 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:09,092 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2021-10-21 19:41:09,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:09,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783240007] [2021-10-21 19:41:09,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:09,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:41:09,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:09,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783240007] [2021-10-21 19:41:09,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783240007] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:09,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:09,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:41:09,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939882631] [2021-10-21 19:41:09,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:41:09,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:41:09,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:09,141 INFO L87 Difference]: Start difference. First operand 230 states and 333 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:09,178 INFO L93 Difference]: Finished difference Result 452 states and 656 transitions. [2021-10-21 19:41:09,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:41:09,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-21 19:41:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:09,203 INFO L225 Difference]: With dead ends: 452 [2021-10-21 19:41:09,203 INFO L226 Difference]: Without dead ends: 230 [2021-10-21 19:41:09,205 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-21 19:41:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-10-21 19:41:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 229 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2021-10-21 19:41:09,224 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 39 [2021-10-21 19:41:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:09,225 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2021-10-21 19:41:09,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2021-10-21 19:41:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:41:09,227 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:09,227 INFO L512 BasicCegarLoop]: trace 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] [2021-10-21 19:41:09,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:41:09,227 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2021-10-21 19:41:09,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:09,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011063140] [2021-10-21 19:41:09,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:09,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:41:09,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:09,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011063140] [2021-10-21 19:41:09,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011063140] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:09,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:09,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:41:09,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234839869] [2021-10-21 19:41:09,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:41:09,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:09,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:41:09,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:41:09,272 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:09,368 INFO L93 Difference]: Finished difference Result 598 states and 833 transitions. [2021-10-21 19:41:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:41:09,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-21 19:41:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:09,371 INFO L225 Difference]: With dead ends: 598 [2021-10-21 19:41:09,371 INFO L226 Difference]: Without dead ends: 377 [2021-10-21 19:41:09,372 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:41:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-10-21 19:41:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 230. [2021-10-21 19:41:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3799126637554586) internal successors, (316), 229 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 316 transitions. [2021-10-21 19:41:09,392 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 316 transitions. Word has length 39 [2021-10-21 19:41:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:09,393 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 316 transitions. [2021-10-21 19:41:09,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 316 transitions. [2021-10-21 19:41:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:41:09,395 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:09,395 INFO L512 BasicCegarLoop]: trace 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] [2021-10-21 19:41:09,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:41:09,396 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash -50403306, now seen corresponding path program 1 times [2021-10-21 19:41:09,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:09,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502297282] [2021-10-21 19:41:09,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:09,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:41:09,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:09,439 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502297282] [2021-10-21 19:41:09,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502297282] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:09,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:09,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:41:09,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696199653] [2021-10-21 19:41:09,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:41:09,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:09,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:41:09,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:41:09,442 INFO L87 Difference]: Start difference. First operand 230 states and 316 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:09,563 INFO L93 Difference]: Finished difference Result 784 states and 1078 transitions. [2021-10-21 19:41:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:41:09,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-21 19:41:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:09,568 INFO L225 Difference]: With dead ends: 784 [2021-10-21 19:41:09,568 INFO L226 Difference]: Without dead ends: 565 [2021-10-21 19:41:09,569 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:41:09,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-10-21 19:41:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 519. [2021-10-21 19:41:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.3494208494208495) internal successors, (699), 518 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 699 transitions. [2021-10-21 19:41:09,617 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 699 transitions. Word has length 39 [2021-10-21 19:41:09,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:09,617 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 699 transitions. [2021-10-21 19:41:09,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 699 transitions. [2021-10-21 19:41:09,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-21 19:41:09,619 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:09,620 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-10-21 19:41:09,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 19:41:09,620 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:09,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash 23055374, now seen corresponding path program 1 times [2021-10-21 19:41:09,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:09,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421589618] [2021-10-21 19:41:09,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:09,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-21 19:41:09,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:09,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421589618] [2021-10-21 19:41:09,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421589618] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:09,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:09,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:41:09,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13710734] [2021-10-21 19:41:09,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:41:09,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:09,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:41:09,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:41:09,690 INFO L87 Difference]: Start difference. First operand 519 states and 699 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:09,853 INFO L93 Difference]: Finished difference Result 1311 states and 1775 transitions. [2021-10-21 19:41:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:41:09,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-21 19:41:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:09,859 INFO L225 Difference]: With dead ends: 1311 [2021-10-21 19:41:09,859 INFO L226 Difference]: Without dead ends: 813 [2021-10-21 19:41:09,861 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:41:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-10-21 19:41:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 540. [2021-10-21 19:41:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 539 states have (on average 1.3191094619666048) internal successors, (711), 539 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 711 transitions. [2021-10-21 19:41:09,921 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 711 transitions. Word has length 51 [2021-10-21 19:41:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:09,922 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 711 transitions. [2021-10-21 19:41:09,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 711 transitions. [2021-10-21 19:41:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-21 19:41:09,928 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:09,928 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-10-21 19:41:09,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:41:09,929 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash 724655248, now seen corresponding path program 1 times [2021-10-21 19:41:09,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:09,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074671594] [2021-10-21 19:41:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:09,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:41:09,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:09,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074671594] [2021-10-21 19:41:09,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074671594] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:09,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:09,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:41:09,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207774410] [2021-10-21 19:41:09,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:41:09,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:09,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:41:09,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:09,981 INFO L87 Difference]: Start difference. First operand 540 states and 711 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:10,102 INFO L93 Difference]: Finished difference Result 1511 states and 1975 transitions. [2021-10-21 19:41:10,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:41:10,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-10-21 19:41:10,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:10,110 INFO L225 Difference]: With dead ends: 1511 [2021-10-21 19:41:10,110 INFO L226 Difference]: Without dead ends: 996 [2021-10-21 19:41:10,111 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:10,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-10-21 19:41:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 960. [2021-10-21 19:41:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 959 states have (on average 1.278415015641293) internal successors, (1226), 959 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1226 transitions. [2021-10-21 19:41:10,192 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1226 transitions. Word has length 51 [2021-10-21 19:41:10,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:10,192 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 1226 transitions. [2021-10-21 19:41:10,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:10,192 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1226 transitions. [2021-10-21 19:41:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-21 19:41:10,194 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:10,194 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-10-21 19:41:10,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:41:10,195 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:10,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash 171160657, now seen corresponding path program 1 times [2021-10-21 19:41:10,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:10,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577283486] [2021-10-21 19:41:10,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:10,196 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 19:41:10,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:10,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577283486] [2021-10-21 19:41:10,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577283486] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:10,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:10,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 19:41:10,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096989012] [2021-10-21 19:41:10,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:41:10,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:10,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:41:10,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:10,282 INFO L87 Difference]: Start difference. First operand 960 states and 1226 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:10,463 INFO L93 Difference]: Finished difference Result 2284 states and 2945 transitions. [2021-10-21 19:41:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:41:10,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-10-21 19:41:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:10,475 INFO L225 Difference]: With dead ends: 2284 [2021-10-21 19:41:10,475 INFO L226 Difference]: Without dead ends: 1602 [2021-10-21 19:41:10,480 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2021-10-21 19:41:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1312. [2021-10-21 19:41:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 1.2799389778794814) internal successors, (1678), 1311 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1678 transitions. [2021-10-21 19:41:10,610 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1678 transitions. Word has length 52 [2021-10-21 19:41:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:10,611 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 1678 transitions. [2021-10-21 19:41:10,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1678 transitions. [2021-10-21 19:41:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-21 19:41:10,612 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:10,613 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2021-10-21 19:41:10,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:41:10,613 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash 313852773, now seen corresponding path program 1 times [2021-10-21 19:41:10,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:10,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236591177] [2021-10-21 19:41:10,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:10,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:41:10,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:10,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236591177] [2021-10-21 19:41:10,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236591177] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:10,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:10,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:41:10,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310744429] [2021-10-21 19:41:10,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:41:10,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:10,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:41:10,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:41:10,696 INFO L87 Difference]: Start difference. First operand 1312 states and 1678 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:10,892 INFO L93 Difference]: Finished difference Result 2538 states and 3250 transitions. [2021-10-21 19:41:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:41:10,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-21 19:41:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:10,902 INFO L225 Difference]: With dead ends: 2538 [2021-10-21 19:41:10,902 INFO L226 Difference]: Without dead ends: 1554 [2021-10-21 19:41:10,904 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:41:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2021-10-21 19:41:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1324. [2021-10-21 19:41:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 1.251700680272109) internal successors, (1656), 1323 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1656 transitions. [2021-10-21 19:41:11,033 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1656 transitions. Word has length 63 [2021-10-21 19:41:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:11,033 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 1656 transitions. [2021-10-21 19:41:11,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1656 transitions. [2021-10-21 19:41:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-21 19:41:11,035 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:11,035 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2021-10-21 19:41:11,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:41:11,036 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:11,036 INFO L82 PathProgramCache]: Analyzing trace with hash 736554599, now seen corresponding path program 1 times [2021-10-21 19:41:11,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:11,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778916224] [2021-10-21 19:41:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:11,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:41:11,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:11,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778916224] [2021-10-21 19:41:11,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778916224] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:11,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:11,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:41:11,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385838647] [2021-10-21 19:41:11,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:41:11,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:11,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:41:11,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:11,098 INFO L87 Difference]: Start difference. First operand 1324 states and 1656 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:11,335 INFO L93 Difference]: Finished difference Result 3688 states and 4602 transitions. [2021-10-21 19:41:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:41:11,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-21 19:41:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:11,352 INFO L225 Difference]: With dead ends: 3688 [2021-10-21 19:41:11,352 INFO L226 Difference]: Without dead ends: 2410 [2021-10-21 19:41:11,357 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2021-10-21 19:41:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2384. [2021-10-21 19:41:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 2383 states have (on average 1.229542593369702) internal successors, (2930), 2383 states have internal predecessors, (2930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 2930 transitions. [2021-10-21 19:41:11,568 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 2930 transitions. Word has length 63 [2021-10-21 19:41:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:11,568 INFO L470 AbstractCegarLoop]: Abstraction has 2384 states and 2930 transitions. [2021-10-21 19:41:11,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 2930 transitions. [2021-10-21 19:41:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-21 19:41:11,570 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:11,570 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2021-10-21 19:41:11,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 19:41:11,571 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1397696040, now seen corresponding path program 1 times [2021-10-21 19:41:11,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:11,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401294672] [2021-10-21 19:41:11,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:11,573 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:41:11,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:11,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401294672] [2021-10-21 19:41:11,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401294672] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:11,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:11,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:41:11,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087216874] [2021-10-21 19:41:11,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:41:11,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:11,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:41:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:41:11,639 INFO L87 Difference]: Start difference. First operand 2384 states and 2930 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:11,866 INFO L93 Difference]: Finished difference Result 4188 states and 5143 transitions. [2021-10-21 19:41:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:41:11,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-21 19:41:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:11,877 INFO L225 Difference]: With dead ends: 4188 [2021-10-21 19:41:11,877 INFO L226 Difference]: Without dead ends: 1829 [2021-10-21 19:41:11,881 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:41:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2021-10-21 19:41:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2021-10-21 19:41:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.2073304157549234) internal successors, (2207), 1828 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2207 transitions. [2021-10-21 19:41:12,033 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2207 transitions. Word has length 64 [2021-10-21 19:41:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:12,033 INFO L470 AbstractCegarLoop]: Abstraction has 1829 states and 2207 transitions. [2021-10-21 19:41:12,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2207 transitions. [2021-10-21 19:41:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-21 19:41:12,035 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:12,036 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:41:12,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 19:41:12,036 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:12,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:12,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1733249900, now seen corresponding path program 1 times [2021-10-21 19:41:12,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:12,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325459854] [2021-10-21 19:41:12,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:12,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 19:41:12,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:12,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325459854] [2021-10-21 19:41:12,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325459854] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:12,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:12,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:41:12,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296498417] [2021-10-21 19:41:12,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:41:12,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:12,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:41:12,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:41:12,074 INFO L87 Difference]: Start difference. First operand 1829 states and 2207 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:12,278 INFO L93 Difference]: Finished difference Result 3653 states and 4407 transitions. [2021-10-21 19:41:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:41:12,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-21 19:41:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:12,288 INFO L225 Difference]: With dead ends: 3653 [2021-10-21 19:41:12,288 INFO L226 Difference]: Without dead ends: 1582 [2021-10-21 19:41:12,291 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:41:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2021-10-21 19:41:12,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1559. [2021-10-21 19:41:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1558 states have (on average 1.1976893453145059) internal successors, (1866), 1558 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1866 transitions. [2021-10-21 19:41:12,413 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1866 transitions. Word has length 94 [2021-10-21 19:41:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:12,413 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 1866 transitions. [2021-10-21 19:41:12,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1866 transitions. [2021-10-21 19:41:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-21 19:41:12,415 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:12,415 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:41:12,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 19:41:12,416 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:12,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:12,416 INFO L82 PathProgramCache]: Analyzing trace with hash -41173677, now seen corresponding path program 1 times [2021-10-21 19:41:12,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:12,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006334167] [2021-10-21 19:41:12,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:12,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 19:41:12,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:12,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006334167] [2021-10-21 19:41:12,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006334167] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:12,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:12,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:41:12,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998987061] [2021-10-21 19:41:12,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:41:12,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:12,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:41:12,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:41:12,483 INFO L87 Difference]: Start difference. First operand 1559 states and 1866 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:12,613 INFO L93 Difference]: Finished difference Result 2548 states and 3026 transitions. [2021-10-21 19:41:12,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:41:12,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-21 19:41:12,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:12,618 INFO L225 Difference]: With dead ends: 2548 [2021-10-21 19:41:12,618 INFO L226 Difference]: Without dead ends: 699 [2021-10-21 19:41:12,622 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:41:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-10-21 19:41:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2021-10-21 19:41:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.1131805157593124) internal successors, (777), 698 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 777 transitions. [2021-10-21 19:41:12,688 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 777 transitions. Word has length 94 [2021-10-21 19:41:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:12,688 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 777 transitions. [2021-10-21 19:41:12,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 777 transitions. [2021-10-21 19:41:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-21 19:41:12,690 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:12,690 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:41:12,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 19:41:12,691 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash -400908240, now seen corresponding path program 1 times [2021-10-21 19:41:12,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:12,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407572761] [2021-10-21 19:41:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:12,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:41:12,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:12,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407572761] [2021-10-21 19:41:12,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407572761] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:12,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:12,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:41:12,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413638442] [2021-10-21 19:41:12,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 19:41:12,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 19:41:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:12,731 INFO L87 Difference]: Start difference. First operand 699 states and 777 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:12,798 INFO L93 Difference]: Finished difference Result 1019 states and 1137 transitions. [2021-10-21 19:41:12,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 19:41:12,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-21 19:41:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:12,802 INFO L225 Difference]: With dead ends: 1019 [2021-10-21 19:41:12,803 INFO L226 Difference]: Without dead ends: 582 [2021-10-21 19:41:12,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 19:41:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-10-21 19:41:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2021-10-21 19:41:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.1032702237521514) internal successors, (641), 581 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2021-10-21 19:41:12,846 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 94 [2021-10-21 19:41:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:12,847 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2021-10-21 19:41:12,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2021-10-21 19:41:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-21 19:41:12,848 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:41:12,849 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:41:12,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 19:41:12,849 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:41:12,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:41:12,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1944009862, now seen corresponding path program 1 times [2021-10-21 19:41:12,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:41:12,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380055210] [2021-10-21 19:41:12,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:41:12,850 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:41:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:41:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 19:41:12,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:41:12,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380055210] [2021-10-21 19:41:12,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380055210] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:41:12,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:41:12,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:41:12,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615492030] [2021-10-21 19:41:12,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:41:12,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:41:12,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:41:12,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:41:12,920 INFO L87 Difference]: Start difference. First operand 582 states and 641 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:41:12,979 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2021-10-21 19:41:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:41:12,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-10-21 19:41:12,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:41:12,980 INFO L225 Difference]: With dead ends: 586 [2021-10-21 19:41:12,980 INFO L226 Difference]: Without dead ends: 0 [2021-10-21 19:41:12,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:41:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-21 19:41:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-21 19:41:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-21 19:41:12,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-10-21 19:41:12,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:41:12,983 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 19:41:12,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:41:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-21 19:41:12,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-21 19:41:12,986 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:41:12,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 19:41:12,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-21 19:41:12,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:13,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,609 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:14,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:15,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:15,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:15,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:15,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 19:41:25,674 INFO L857 garLoopResultBuilder]: For program point L135(lines 135 144) no Hoare annotation was computed. [2021-10-21 19:41:25,674 INFO L857 garLoopResultBuilder]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2021-10-21 19:41:25,674 INFO L857 garLoopResultBuilder]: For program point L36(lines 36 44) no Hoare annotation was computed. [2021-10-21 19:41:25,674 INFO L857 garLoopResultBuilder]: For program point L135-3(lines 135 144) no Hoare annotation was computed. [2021-10-21 19:41:25,674 INFO L857 garLoopResultBuilder]: For program point L135-5(lines 135 144) no Hoare annotation was computed. [2021-10-21 19:41:25,675 INFO L857 garLoopResultBuilder]: For program point L135-6(lines 135 144) no Hoare annotation was computed. [2021-10-21 19:41:25,675 INFO L857 garLoopResultBuilder]: For program point L135-8(lines 135 144) no Hoare annotation was computed. [2021-10-21 19:41:25,675 INFO L857 garLoopResultBuilder]: For program point L135-9(lines 135 144) no Hoare annotation was computed. [2021-10-21 19:41:25,675 INFO L857 garLoopResultBuilder]: For program point L135-11(lines 135 144) no Hoare annotation was computed. [2021-10-21 19:41:25,675 INFO L857 garLoopResultBuilder]: For program point L135-12(lines 135 144) no Hoare annotation was computed. [2021-10-21 19:41:25,675 INFO L857 garLoopResultBuilder]: For program point L135-14(lines 135 144) no Hoare annotation was computed. [2021-10-21 19:41:25,676 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 141) no Hoare annotation was computed. [2021-10-21 19:41:25,676 INFO L857 garLoopResultBuilder]: For program point L136-1(lines 136 141) no Hoare annotation was computed. [2021-10-21 19:41:25,676 INFO L857 garLoopResultBuilder]: For program point L136-2(lines 136 141) no Hoare annotation was computed. [2021-10-21 19:41:25,676 INFO L857 garLoopResultBuilder]: For program point L136-3(lines 136 141) no Hoare annotation was computed. [2021-10-21 19:41:25,676 INFO L857 garLoopResultBuilder]: For program point L136-4(lines 136 141) no Hoare annotation was computed. [2021-10-21 19:41:25,677 INFO L853 garLoopResultBuilder]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,677 INFO L857 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2021-10-21 19:41:25,677 INFO L853 garLoopResultBuilder]: At program point L402(lines 386 404) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,677 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-10-21 19:41:25,678 INFO L853 garLoopResultBuilder]: At program point L40(lines 35 74) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~t1_i~0 1) (<= ~token~0 (+ ~local~0 1)) (<= 2 ~T1_E~0) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (= ~E_M~0 2) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2021-10-21 19:41:25,678 INFO L857 garLoopResultBuilder]: For program point L207(lines 207 211) no Hoare annotation was computed. [2021-10-21 19:41:25,678 INFO L857 garLoopResultBuilder]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2021-10-21 19:41:25,678 INFO L857 garLoopResultBuilder]: For program point L439(lines 439 448) no Hoare annotation was computed. [2021-10-21 19:41:25,678 INFO L853 garLoopResultBuilder]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,679 INFO L853 garLoopResultBuilder]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,679 INFO L853 garLoopResultBuilder]: At program point L473(lines 464 475) the Hoare annotation is: (= ~t1_i~0 1) [2021-10-21 19:41:25,679 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-21 19:41:25,679 INFO L857 garLoopResultBuilder]: For program point L311(lines 311 315) no Hoare annotation was computed. [2021-10-21 19:41:25,679 INFO L857 garLoopResultBuilder]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2021-10-21 19:41:25,680 INFO L857 garLoopResultBuilder]: For program point L311-3(lines 311 315) no Hoare annotation was computed. [2021-10-21 19:41:25,680 INFO L853 garLoopResultBuilder]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,680 INFO L853 garLoopResultBuilder]: At program point L146(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~M_E~0)) (.cse5 (= ~E_M~0 ~E_1~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= ~m_pc~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0)))) [2021-10-21 19:41:25,680 INFO L857 garLoopResultBuilder]: For program point L311-5(lines 311 315) no Hoare annotation was computed. [2021-10-21 19:41:25,680 INFO L853 garLoopResultBuilder]: At program point L146-1(lines 134 148) the Hoare annotation is: (let ((.cse9 (not (= ~t1_st~0 0))) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse8 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~E_1~0 1)) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 (not .cse10) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-10-21 19:41:25,681 INFO L857 garLoopResultBuilder]: For program point L311-6(lines 311 315) no Hoare annotation was computed. [2021-10-21 19:41:25,681 INFO L857 garLoopResultBuilder]: For program point L80(lines 80 88) no Hoare annotation was computed. [2021-10-21 19:41:25,681 INFO L853 garLoopResultBuilder]: At program point L146-2(lines 134 148) the Hoare annotation is: (let ((.cse6 (= ~m_st~0 0))) (let ((.cse5 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (not .cse6)) (.cse7 (not (= ~E_1~0 1))) (.cse3 (not (= ~E_1~0 0))) (.cse4 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse8 (not (= ~t1_st~0 0)))) (or (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 (= ~m_pc~0 0) .cse4) (and (= ~t1_pc~0 1) .cse5 .cse0 .cse6 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse7 .cse3 .cse8 (< ~local~0 ~token~0)) (and .cse5 .cse0 .cse1 .cse2 .cse7 .cse3 .cse4 .cse8)))) [2021-10-21 19:41:25,681 INFO L857 garLoopResultBuilder]: For program point L311-8(lines 311 315) no Hoare annotation was computed. [2021-10-21 19:41:25,681 INFO L853 garLoopResultBuilder]: At program point L146-3(lines 134 148) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1))) (let ((.cse11 (not (= ~m_st~0 0))) (.cse3 (not .cse14)) (.cse7 (= ~m_pc~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse8 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse14 .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse12 .cse6 .cse8 .cse9 .cse10 (< ~local~0 ~token~0))))) [2021-10-21 19:41:25,681 INFO L857 garLoopResultBuilder]: For program point L311-9(lines 311 315) no Hoare annotation was computed. [2021-10-21 19:41:25,681 INFO L853 garLoopResultBuilder]: At program point L146-4(lines 134 148) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1))) (let ((.cse11 (not (= ~m_st~0 0))) (.cse3 (not .cse14)) (.cse7 (= ~m_pc~0 0)) (.cse13 (= ~token~0 ~local~0)) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse8 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse12 .cse6 .cse8 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse14 .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse12 .cse6 .cse8 .cse9 .cse10 (< ~local~0 ~token~0))))) [2021-10-21 19:41:25,681 INFO L857 garLoopResultBuilder]: For program point L311-11(lines 311 315) no Hoare annotation was computed. [2021-10-21 19:41:25,682 INFO L857 garLoopResultBuilder]: For program point L311-12(lines 311 315) no Hoare annotation was computed. [2021-10-21 19:41:25,682 INFO L857 garLoopResultBuilder]: For program point L311-14(lines 311 315) no Hoare annotation was computed. [2021-10-21 19:41:25,682 INFO L853 garLoopResultBuilder]: At program point L345(lines 339 347) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,682 INFO L857 garLoopResultBuilder]: For program point L279-1(lines 278 301) no Hoare annotation was computed. [2021-10-21 19:41:25,682 INFO L857 garLoopResultBuilder]: For program point L180(lines 180 190) no Hoare annotation was computed. [2021-10-21 19:41:25,682 INFO L857 garLoopResultBuilder]: For program point L279-3(lines 278 301) no Hoare annotation was computed. [2021-10-21 19:41:25,682 INFO L853 garLoopResultBuilder]: At program point L147(lines 131 149) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~M_E~0)) (.cse5 (= ~E_M~0 ~E_1~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~m_st~0 0)) .cse10 .cse11 .cse12))) [2021-10-21 19:41:25,683 INFO L857 garLoopResultBuilder]: For program point L180-1(lines 180 190) no Hoare annotation was computed. [2021-10-21 19:41:25,683 INFO L853 garLoopResultBuilder]: At program point L147-1(lines 131 149) the Hoare annotation is: (let ((.cse9 (not (= ~t1_st~0 0))) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse8 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0)) (and .cse10 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 (not (= ~E_1~0 1)) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse2 (not .cse0) .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8))) [2021-10-21 19:41:25,683 INFO L857 garLoopResultBuilder]: For program point L180-2(lines 180 190) no Hoare annotation was computed. [2021-10-21 19:41:25,683 INFO L853 garLoopResultBuilder]: At program point L147-2(lines 131 149) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0))) (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse2)) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse9 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse7 (not (= ~t1_st~0 0)))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 (< ~local~0 ~token~0)) (and .cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse8 .cse6 (= ~m_pc~0 0) .cse9) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5 .cse6 .cse9 .cse7)))) [2021-10-21 19:41:25,683 INFO L857 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2021-10-21 19:41:25,684 INFO L853 garLoopResultBuilder]: At program point L147-3(lines 131 149) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse11 (not (= ~t1_st~0 0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse13 (not .cse15)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ~E_M~0 2)) (.cse12 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse7 .cse8 .cse9 .cse10) (and .cse15 .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse14 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12)))) [2021-10-21 19:41:25,684 INFO L853 garLoopResultBuilder]: At program point L147-4(lines 131 149) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse11 (not (= ~t1_st~0 0))) (.cse14 (not (= ~m_st~0 0))) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse13 (not .cse15)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ~E_M~0 2)) (.cse12 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse7 .cse8 .cse9 .cse10) (and .cse15 .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse14 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12)))) [2021-10-21 19:41:25,684 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 222) no Hoare annotation was computed. [2021-10-21 19:41:25,684 INFO L857 garLoopResultBuilder]: For program point L116(lines 116 125) no Hoare annotation was computed. [2021-10-21 19:41:25,684 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 87) no Hoare annotation was computed. [2021-10-21 19:41:25,685 INFO L857 garLoopResultBuilder]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2021-10-21 19:41:25,685 INFO L857 garLoopResultBuilder]: For program point L116-3(lines 116 125) no Hoare annotation was computed. [2021-10-21 19:41:25,685 INFO L857 garLoopResultBuilder]: For program point L116-5(lines 116 125) no Hoare annotation was computed. [2021-10-21 19:41:25,685 INFO L857 garLoopResultBuilder]: For program point L116-6(lines 116 125) no Hoare annotation was computed. [2021-10-21 19:41:25,685 INFO L857 garLoopResultBuilder]: For program point L116-8(lines 116 125) no Hoare annotation was computed. [2021-10-21 19:41:25,685 INFO L857 garLoopResultBuilder]: For program point L116-9(lines 116 125) no Hoare annotation was computed. [2021-10-21 19:41:25,686 INFO L857 garLoopResultBuilder]: For program point L116-11(lines 116 125) no Hoare annotation was computed. [2021-10-21 19:41:25,686 INFO L857 garLoopResultBuilder]: For program point L116-12(lines 116 125) no Hoare annotation was computed. [2021-10-21 19:41:25,686 INFO L857 garLoopResultBuilder]: For program point L116-14(lines 116 125) no Hoare annotation was computed. [2021-10-21 19:41:25,686 INFO L857 garLoopResultBuilder]: For program point L117(lines 117 122) no Hoare annotation was computed. [2021-10-21 19:41:25,686 INFO L857 garLoopResultBuilder]: For program point L117-1(lines 117 122) no Hoare annotation was computed. [2021-10-21 19:41:25,686 INFO L853 garLoopResultBuilder]: At program point L84(lines 79 110) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (not (= ~E_1~0 0))) (.cse4 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse5 (= ~E_M~0 2))) (or (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 (= ~m_pc~0 0) .cse4 .cse5) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 (not (= ~E_1~0 1)) .cse3 .cse4 .cse5 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2021-10-21 19:41:25,687 INFO L857 garLoopResultBuilder]: For program point L117-2(lines 117 122) no Hoare annotation was computed. [2021-10-21 19:41:25,687 INFO L857 garLoopResultBuilder]: For program point L117-3(lines 117 122) no Hoare annotation was computed. [2021-10-21 19:41:25,687 INFO L857 garLoopResultBuilder]: For program point L117-4(lines 117 122) no Hoare annotation was computed. [2021-10-21 19:41:25,687 INFO L857 garLoopResultBuilder]: For program point L184(lines 184 189) no Hoare annotation was computed. [2021-10-21 19:41:25,687 INFO L857 garLoopResultBuilder]: For program point L184-1(lines 184 189) no Hoare annotation was computed. [2021-10-21 19:41:25,687 INFO L857 garLoopResultBuilder]: For program point L184-2(lines 184 189) no Hoare annotation was computed. [2021-10-21 19:41:25,688 INFO L853 garLoopResultBuilder]: At program point L383(lines 376 385) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (<= 2 ~M_E~0) (= ~E_M~0 ~E_1~0) (<= 2 ~T1_E~0) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0)) [2021-10-21 19:41:25,688 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-21 19:41:25,688 INFO L857 garLoopResultBuilder]: For program point L284-1(lines 278 301) no Hoare annotation was computed. [2021-10-21 19:41:25,688 INFO L857 garLoopResultBuilder]: For program point L251-1(lines 250 273) no Hoare annotation was computed. [2021-10-21 19:41:25,688 INFO L857 garLoopResultBuilder]: For program point L251-2(lines 251 255) no Hoare annotation was computed. [2021-10-21 19:41:25,688 INFO L857 garLoopResultBuilder]: For program point L284-3(lines 278 301) no Hoare annotation was computed. [2021-10-21 19:41:25,689 INFO L857 garLoopResultBuilder]: For program point L251-4(lines 250 273) no Hoare annotation was computed. [2021-10-21 19:41:25,689 INFO L857 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2021-10-21 19:41:25,689 INFO L857 garLoopResultBuilder]: For program point L352-1(lines 351 374) no Hoare annotation was computed. [2021-10-21 19:41:25,689 INFO L853 garLoopResultBuilder]: At program point L319-2(lines 279 283) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~M_E~0)) (.cse6 (= ~E_M~0 ~E_1~0)) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse11 (= ~m_pc~0 0)) (.cse12 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse13 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~m_st~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0)))) [2021-10-21 19:41:25,689 INFO L857 garLoopResultBuilder]: For program point L319-3(lines 319 323) no Hoare annotation was computed. [2021-10-21 19:41:25,690 INFO L853 garLoopResultBuilder]: At program point L319-5(lines 1 475) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse8 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0)) (and (= ULTIMATE.start_activate_threads_~tmp___0~0 0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 .cse2 (not .cse0) .cse3 .cse4 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~t1_st~0 0))))) [2021-10-21 19:41:25,690 INFO L857 garLoopResultBuilder]: For program point L319-6(lines 319 323) no Hoare annotation was computed. [2021-10-21 19:41:25,690 INFO L853 garLoopResultBuilder]: At program point L319-8(lines 1 475) the Hoare annotation is: (let ((.cse5 (= ~m_st~0 0))) (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (not .cse5)) (.cse6 (not (= ~E_1~0 1))) (.cse3 (not (= ~E_1~0 0))) (.cse4 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (or (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 (= ~m_pc~0 0) .cse4) (and (= ~t1_pc~0 1) .cse0 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse6 .cse3 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse6 .cse3 .cse4)))) [2021-10-21 19:41:25,690 INFO L857 garLoopResultBuilder]: For program point L319-9(lines 319 323) no Hoare annotation was computed. [2021-10-21 19:41:25,691 INFO L853 garLoopResultBuilder]: At program point L319-11(lines 279 283) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,691 INFO L857 garLoopResultBuilder]: For program point L319-12(lines 319 323) no Hoare annotation was computed. [2021-10-21 19:41:25,691 INFO L853 garLoopResultBuilder]: At program point L319-14(lines 352 356) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,691 INFO L857 garLoopResultBuilder]: For program point L452(lines 452 456) no Hoare annotation was computed. [2021-10-21 19:41:25,691 INFO L853 garLoopResultBuilder]: At program point L155(lines 162 166) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (<= 2 ~M_E~0) (= ~E_M~0 ~E_1~0) (<= 2 ~T1_E~0) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0)) [2021-10-21 19:41:25,692 INFO L853 garLoopResultBuilder]: At program point L155-1(lines 150 157) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,692 INFO L853 garLoopResultBuilder]: At program point L420-1(lines 275 457) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,692 INFO L857 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2021-10-21 19:41:25,692 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-21 19:41:25,693 INFO L857 garLoopResultBuilder]: For program point L289-1(lines 278 301) no Hoare annotation was computed. [2021-10-21 19:41:25,693 INFO L857 garLoopResultBuilder]: For program point L256-1(lines 250 273) no Hoare annotation was computed. [2021-10-21 19:41:25,693 INFO L857 garLoopResultBuilder]: For program point L289-3(lines 278 301) no Hoare annotation was computed. [2021-10-21 19:41:25,693 INFO L857 garLoopResultBuilder]: For program point L256-3(lines 250 273) no Hoare annotation was computed. [2021-10-21 19:41:25,693 INFO L853 garLoopResultBuilder]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0))) (let ((.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse0 (= ~t1_i~0 1)) (.cse2 (<= 2 ~T1_E~0)) (.cse9 (not .cse10)) (.cse4 (not (= ~E_1~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse7 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse8 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse8) (and (= ~t1_pc~0 1) .cse0 .cse10 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse4 .cse5 .cse8 (< ~local~0 ~token~0)) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse7 .cse8)))) [2021-10-21 19:41:25,693 INFO L857 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2021-10-21 19:41:25,694 INFO L857 garLoopResultBuilder]: For program point L357-1(lines 351 374) no Hoare annotation was computed. [2021-10-21 19:41:25,694 INFO L853 garLoopResultBuilder]: At program point L192(lines 179 194) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,694 INFO L853 garLoopResultBuilder]: At program point L192-1(lines 179 194) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,694 INFO L853 garLoopResultBuilder]: At program point L192-2(lines 179 194) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,694 INFO L853 garLoopResultBuilder]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,694 INFO L853 garLoopResultBuilder]: At program point L193(lines 176 195) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,695 INFO L853 garLoopResultBuilder]: At program point L193-1(lines 176 195) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,695 INFO L853 garLoopResultBuilder]: At program point L127(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (<= 2 ~M_E~0)) (.cse3 (= ~E_M~0 ~E_1~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8))) [2021-10-21 19:41:25,695 INFO L853 garLoopResultBuilder]: At program point L193-2(lines 176 195) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,696 INFO L853 garLoopResultBuilder]: At program point L127-1(lines 115 129) the Hoare annotation is: (let ((.cse1 (= ~t1_i~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)) (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (not .cse0) .cse2 .cse3 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) .cse4 .cse5 .cse6))) [2021-10-21 19:41:25,696 INFO L853 garLoopResultBuilder]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1))) (let ((.cse11 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse14)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse12 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse5 (<= 2 ~T1_E~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse13 (= ~E_M~0 2)) (.cse15 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse15) (and .cse14 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse8 .cse9 .cse10 .cse13 .cse15 (< ~local~0 ~token~0))))) [2021-10-21 19:41:25,696 INFO L853 garLoopResultBuilder]: At program point L127-2(lines 115 129) the Hoare annotation is: (let ((.cse4 (not (= ~E_1~0 1))) (.cse6 (not (= ~t1_st~0 0))) (.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~t1_pc~0 1) .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse3 .cse4 .cse5 .cse6 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 (= ~m_pc~0 0)))) [2021-10-21 19:41:25,696 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-21 19:41:25,697 INFO L853 garLoopResultBuilder]: At program point L127-3(lines 115 129) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse13 (= ~token~0 ~local~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (not .cse12)) (.cse10 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse4 (not (= ~E_1~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 0))) (.cse11 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse5 .cse11 .cse6 .cse13) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse13) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7) (and .cse12 .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse6)))) [2021-10-21 19:41:25,697 INFO L853 garLoopResultBuilder]: At program point L127-4(lines 115 129) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1))) (let ((.cse13 (= ~token~0 ~local~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (not .cse12)) (.cse10 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse4 (not (= ~E_1~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse0 (= ~t1_i~0 1)) (.cse1 (<= 2 ~T1_E~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 0))) (.cse11 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse5 .cse11 .cse6 .cse7) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse5 .cse11 .cse6 .cse13) (and .cse12 .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse6 .cse7 .cse13) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7) (and .cse12 .cse0 (<= ~token~0 (+ ~local~0 1)) .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse6)))) [2021-10-21 19:41:25,697 INFO L853 garLoopResultBuilder]: At program point L458(lines 405 463) the Hoare annotation is: (= ~t1_i~0 1) [2021-10-21 19:41:25,697 INFO L853 garLoopResultBuilder]: At program point L128(lines 112 130) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (<= 2 ~M_E~0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_st~0 0)) .cse8 .cse9))) [2021-10-21 19:41:25,697 INFO L853 garLoopResultBuilder]: At program point L128-1(lines 112 130) the Hoare annotation is: (let ((.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse0 (= ~t1_pc~0 1)) (.cse3 (<= 2 ~T1_E~0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)) (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 .cse2 (not .cse0) .cse3 .cse4 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) .cse5 .cse6 .cse7))) [2021-10-21 19:41:25,698 INFO L853 garLoopResultBuilder]: At program point L128-2(lines 112 130) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse0 (= ~t1_i~0 1)) (.cse2 (<= 2 ~T1_E~0)) (.cse4 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse7 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7) (and (= ~t1_pc~0 1) .cse0 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse4 .cse6 .cse5 .cse7 (< ~local~0 ~token~0)))) [2021-10-21 19:41:25,698 INFO L853 garLoopResultBuilder]: At program point L128-3(lines 112 130) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse12 (= ~m_pc~0 0)) (.cse14 (= ~token~0 ~local~0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (= ~t1_i~0 1)) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (not .cse13)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8 .cse14) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse13 .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (< ~local~0 ~token~0)) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse5 .cse6 .cse12 .cse7 .cse14) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7)))) [2021-10-21 19:41:25,698 INFO L853 garLoopResultBuilder]: At program point L128-4(lines 112 130) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse12 (= ~m_pc~0 0)) (.cse14 (= ~token~0 ~local~0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (= ~t1_i~0 1)) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (not .cse13)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse12 .cse7 .cse8 .cse14) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse6 .cse12 .cse7 .cse8) (and .cse13 .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (< ~local~0 ~token~0)) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse5 .cse6 .cse12 .cse7 .cse14) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7)))) [2021-10-21 19:41:25,698 INFO L857 garLoopResultBuilder]: For program point L261-1(lines 250 273) no Hoare annotation was computed. [2021-10-21 19:41:25,699 INFO L853 garLoopResultBuilder]: At program point L294-3(lines 275 302) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse15)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse14 (< ~local~0 ~token~0)) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse13 .cse11 .cse12 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse11 .cse12 .cse16) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,699 INFO L857 garLoopResultBuilder]: For program point L261-3(lines 250 273) no Hoare annotation was computed. [2021-10-21 19:41:25,699 INFO L857 garLoopResultBuilder]: For program point L162-1(lines 161 174) no Hoare annotation was computed. [2021-10-21 19:41:25,699 INFO L857 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2021-10-21 19:41:25,699 INFO L857 garLoopResultBuilder]: For program point L229(lines 229 236) no Hoare annotation was computed. [2021-10-21 19:41:25,700 INFO L857 garLoopResultBuilder]: For program point L362-1(lines 351 374) no Hoare annotation was computed. [2021-10-21 19:41:25,700 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-21 19:41:25,700 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-21 19:41:25,700 INFO L853 garLoopResultBuilder]: At program point L266-1(lines 247 274) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (<= 2 ~M_E~0)) (.cse3 (= ~E_M~0 ~E_1~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_st~0 0)) .cse6 .cse7))) [2021-10-21 19:41:25,700 INFO L853 garLoopResultBuilder]: At program point L266-3(lines 247 274) the Hoare annotation is: (let ((.cse17 (= ~m_st~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse9 (not (= ~E_1~0 1))) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (not .cse13)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse8 (not .cse17)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (= ~E_M~0 2)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse15 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse9 .cse10 .cse12 .cse16 (< ~local~0 ~token~0)) (and .cse2 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16) (and .cse13 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10 .cse15 .cse11 .cse12 .cse16 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse2 .cse3 .cse5 .cse6 .cse8 .cse10 .cse15 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16)))) [2021-10-21 19:41:25,701 INFO L853 garLoopResultBuilder]: At program point L167-1(lines 251 255) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (<= 2 ~M_E~0)) (.cse3 (= ~E_M~0 ~E_1~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_st~0 0)) .cse6 .cse7))) [2021-10-21 19:41:25,705 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:41:25,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:41:25 BoogieIcfgContainer [2021-10-21 19:41:25,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:41:25,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:41:25,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:41:25,843 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:41:25,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:41:08" (3/4) ... [2021-10-21 19:41:25,847 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-21 19:41:25,871 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-21 19:41:25,872 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-21 19:41:25,873 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 19:41:25,874 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 19:41:25,904 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((t1_i == 1 && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && E_M == 2) && token == local) || ((((((((((t1_i == 1 && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) [2021-10-21 19:41:25,904 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,905 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) || (((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) [2021-10-21 19:41:25,905 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || ((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,905 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,906 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-21 19:41:25,906 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-21 19:41:25,907 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-21 19:41:25,907 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-21 19:41:25,907 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-21 19:41:25,908 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-21 19:41:25,909 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-21 19:41:25,909 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) [2021-10-21 19:41:25,909 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2)) || (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) [2021-10-21 19:41:25,910 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token) [2021-10-21 19:41:25,910 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) [2021-10-21 19:41:25,911 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) [2021-10-21 19:41:25,911 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token) [2021-10-21 19:41:25,911 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,912 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,912 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) [2021-10-21 19:41:25,913 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) || ((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) [2021-10-21 19:41:25,913 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,913 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) [2021-10-21 19:41:25,916 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,917 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,917 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) || (((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || (((((((__retres1 == 0 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) [2021-10-21 19:41:25,919 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0)) || ((((((((__retres1 == 0 && t1_i == 1) && 2 <= T1_E) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) [2021-10-21 19:41:25,920 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) [2021-10-21 19:41:25,920 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,920 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) [2021-10-21 19:41:25,920 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,921 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) || (((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && local < token)) || (((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) [2021-10-21 19:41:25,921 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) || (((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) [2021-10-21 19:41:25,922 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,922 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) [2021-10-21 19:41:25,922 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,923 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2)) || (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) [2021-10-21 19:41:25,923 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,923 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,923 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token) [2021-10-21 19:41:25,924 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,926 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) [2021-10-21 19:41:25,995 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:41:25,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:41:25,997 INFO L168 Benchmark]: Toolchain (without parser) took 18929.60 ms. Allocated memory was 86.0 MB in the beginning and 268.4 MB in the end (delta: 182.5 MB). Free memory was 49.8 MB in the beginning and 167.4 MB in the end (delta: -117.6 MB). Peak memory consumption was 63.8 MB. Max. memory is 16.1 GB. [2021-10-21 19:41:25,997 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 86.0 MB. Free memory is still 66.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:41:25,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.94 ms. Allocated memory was 86.0 MB in the beginning and 107.0 MB in the end (delta: 21.0 MB). Free memory was 49.6 MB in the beginning and 81.0 MB in the end (delta: -31.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:41:25,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.97 ms. Allocated memory is still 107.0 MB. Free memory was 81.0 MB in the beginning and 78.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:41:25,999 INFO L168 Benchmark]: Boogie Preprocessor took 35.81 ms. Allocated memory is still 107.0 MB. Free memory was 78.5 MB in the beginning and 76.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:41:25,999 INFO L168 Benchmark]: RCFGBuilder took 629.53 ms. Allocated memory is still 107.0 MB. Free memory was 76.4 MB in the beginning and 56.7 MB in the end (delta: 19.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-21 19:41:26,000 INFO L168 Benchmark]: TraceAbstraction took 17622.28 ms. Allocated memory was 107.0 MB in the beginning and 268.4 MB in the end (delta: 161.5 MB). Free memory was 56.2 MB in the beginning and 177.9 MB in the end (delta: -121.6 MB). Peak memory consumption was 139.7 MB. Max. memory is 16.1 GB. [2021-10-21 19:41:26,000 INFO L168 Benchmark]: Witness Printer took 152.44 ms. Allocated memory is still 268.4 MB. Free memory was 176.8 MB in the beginning and 167.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:41:26,008 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 86.0 MB. Free memory is still 66.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 431.94 ms. Allocated memory was 86.0 MB in the beginning and 107.0 MB in the end (delta: 21.0 MB). Free memory was 49.6 MB in the beginning and 81.0 MB in the end (delta: -31.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.97 ms. Allocated memory is still 107.0 MB. Free memory was 81.0 MB in the beginning and 78.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.81 ms. Allocated memory is still 107.0 MB. Free memory was 78.5 MB in the beginning and 76.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 629.53 ms. Allocated memory is still 107.0 MB. Free memory was 76.4 MB in the beginning and 56.7 MB in the end (delta: 19.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17622.28 ms. Allocated memory was 107.0 MB in the beginning and 268.4 MB in the end (delta: 161.5 MB). Free memory was 56.2 MB in the beginning and 177.9 MB in the end (delta: -121.6 MB). Peak memory consumption was 139.7 MB. Max. memory is 16.1 GB. * Witness Printer took 152.44 ms. Allocated memory is still 268.4 MB. Free memory was 176.8 MB in the beginning and 167.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17411.3ms, OverallIterations: 16, TraceHistogramMax: 3, EmptinessCheckTime: 36.3ms, AutomataDifference: 2274.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 12686.7ms, InitialAbstractionConstructionTime: 13.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3179 SDtfs, 3877 SDslu, 2598 SDs, 0 SdLazy, 401 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 423.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 116.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2384occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1194.2ms AutomataMinimizationTime, 16 MinimizatonAttempts, 1073 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 754 NumberOfFragments, 11288 HoareAnnotationTreeSize, 52 FomulaSimplifications, 76100 FormulaSimplificationTreeSizeReduction, 2126.2ms HoareSimplificationTime, 52 FomulaSimplificationsInter, 27888 FormulaSimplificationTreeSizeReductionInter, 10528.9ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 64.2ms SsaConstructionTime, 201.6ms SatisfiabilityAnalysisTime, 626.9ms InterpolantComputationTime, 955 NumberOfCodeBlocks, 955 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 939 ConstructedInterpolants, 0 QuantifiedInterpolants, 1748 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 167/167 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || ((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0)) || ((((((((__retres1 == 0 && t1_i == 1) && 2 <= T1_E) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || ((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && token == local) || ((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && m_pc == 0) && E_M == 2) && token == local) || ((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2)) || (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) || (((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) || (((((((((t1_pc == 1 && __retres1 == 0) && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || (((((((__retres1 == 0 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && m_pc == 0) && E_M == 2) && token == local) || ((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && m_pc == 0) && E_M == 2) && token == local - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local) || (((((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && m_pc == 0) && E_M == 2) && token == local - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2)) || (((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((((((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) || (((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && local < token)) || (((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && E_M == 2) && token == local) || (((((((((t1_i == 1 && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((((t1_i == 1 && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && m_pc == 0) && E_M == 2) && token == local) || ((((((((((t1_i == 1 && \result == 0) && m_pc == t1_pc) && 2 <= M_E) && E_M == E_1) && 2 <= T1_E) && t1_st == 0) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && token <= local + 1) && 2 <= T1_E) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((t1_i == 1 && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((((((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && token == local)) || ((((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && token == local)) || (((((((((t1_pc == 1 && t1_i == 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((__retres1 == 0 && t1_i == 1) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && E_M == 2) && !(t1_st == 0)) && local < token)) || ((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == 2) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) || ((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || (((((t1_i == 1 && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local) || (((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((__retres1 == 0 && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((((((((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && token <= local + 1) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && local < token)) || (((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && !(t1_st == 0)) && token == local)) || (((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2) && token == local)) || ((((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && tmp == 0) && E_M == 2)) || ((((((((((((tmp___0 == 0 && __retres1 == 0) && t1_i == 1) && \result == 0) && !(t1_pc == 1)) && 2 <= T1_E) && __retres1 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && !(t1_st == 0))) || ((((((((((t1_pc == 1 && t1_i == 1) && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && tmp == 0) && E_M == 2) && token == local) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) || (((((((t1_i == 1 && \result == 0) && 2 <= T1_E) && __retres1 == 0) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0))) || ((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 <= T1_E) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) RESULT: Ultimate proved your program to be correct! [2021-10-21 19:41:26,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f41f99-b322-4034-bad9-972af81ab1ae/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...