./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/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_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg --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-b2eff8b [2021-10-28 09:16:33,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:16:33,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:16:33,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:16:33,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:16:33,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:16:33,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:16:33,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:16:33,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:16:33,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:16:33,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:16:33,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:16:33,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:16:33,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:16:33,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:16:33,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:16:33,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:16:33,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:16:33,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:16:33,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:16:33,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:16:33,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:16:33,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:16:33,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:16:33,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:16:33,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:16:33,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:16:33,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:16:33,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:16:33,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:16:33,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:16:33,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:16:33,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:16:33,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:16:33,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:16:33,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:16:33,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:16:33,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:16:33,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:16:33,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:16:33,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:16:33,674 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:16:33,732 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:16:33,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:16:33,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:16:33,734 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:16:33,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:16:33,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:16:33,744 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:16:33,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:16:33,745 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:16:33,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:16:33,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:16:33,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:16:33,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:16:33,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:16:33,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:16:33,749 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:16:33,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:16:33,749 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:16:33,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:16:33,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:16:33,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:16:33,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:16:33,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:16:33,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:16:33,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:16:33,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:16:33,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:16:33,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:16:33,752 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:16:33,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:16:33,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:16:33,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:16:33,755 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_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/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_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg 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-28 09:16:34,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:16:34,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:16:34,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:16:34,114 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:16:34,115 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:16:34,116 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-28 09:16:34,227 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/data/76d861763/545cf973cb4a4903aeea99b9c875a8a2/FLAGe1e5e6dd0 [2021-10-28 09:16:34,840 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:16:34,841 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-10-28 09:16:34,862 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/data/76d861763/545cf973cb4a4903aeea99b9c875a8a2/FLAGe1e5e6dd0 [2021-10-28 09:16:35,131 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/data/76d861763/545cf973cb4a4903aeea99b9c875a8a2 [2021-10-28 09:16:35,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:16:35,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:16:35,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:16:35,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:16:35,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:16:35,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b2b24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35, skipping insertion in model container [2021-10-28 09:16:35,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:16:35,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:16:35,368 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_9aa63b97-922d-4f08-8118-060b4d41dd55/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-28 09:16:35,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:16:35,444 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:16:35,459 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_9aa63b97-922d-4f08-8118-060b4d41dd55/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] [2021-10-28 09:16:35,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:16:35,510 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:16:35,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35 WrapperNode [2021-10-28 09:16:35,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:16:35,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:16:35,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:16:35,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:16:35,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:16:35,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:16:35,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:16:35,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:16:35,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:16:35,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:16:35,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:16:35,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:16:35,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35" (1/1) ... [2021-10-28 09:16:35,644 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:16:35,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:16:35,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:16:35,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:16:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:16:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:16:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:16:35,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:16:36,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:16:36,772 INFO L299 CfgBuilder]: Removed 80 assume(true) statements. [2021-10-28 09:16:36,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:16:36 BoogieIcfgContainer [2021-10-28 09:16:36,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:16:36,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:16:36,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:16:36,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:16:36,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:16:35" (1/3) ... [2021-10-28 09:16:36,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7031b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:16:36, skipping insertion in model container [2021-10-28 09:16:36,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:16:35" (2/3) ... [2021-10-28 09:16:36,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7031b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:16:36, skipping insertion in model container [2021-10-28 09:16:36,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:16:36" (3/3) ... [2021-10-28 09:16:36,787 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-10-28 09:16:36,795 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:16:36,796 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 09:16:36,861 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:16:36,870 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-28 09:16:36,870 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 09:16:36,896 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-28 09:16:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:36,906 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:36,907 INFO L513 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-28 09:16:36,908 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2021-10-28 09:16:36,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:36,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118074918] [2021-10-28 09:16:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:36,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,150 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-28 09:16:37,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:37,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118074918] [2021-10-28 09:16:37,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118074918] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:37,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:37,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:37,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056173026] [2021-10-28 09:16:37,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:37,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:37,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:37,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:37,184 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-28 09:16:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:37,246 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2021-10-28 09:16:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:37,249 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-28 09:16:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:37,263 INFO L225 Difference]: With dead ends: 277 [2021-10-28 09:16:37,264 INFO L226 Difference]: Without dead ends: 137 [2021-10-28 09:16:37,268 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-28 09:16:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-10-28 09:16:37,325 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-28 09:16:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2021-10-28 09:16:37,331 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2021-10-28 09:16:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:37,332 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2021-10-28 09:16:37,332 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-28 09:16:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2021-10-28 09:16:37,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:37,335 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:37,335 INFO L513 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-28 09:16:37,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:16:37,336 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:37,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:37,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2021-10-28 09:16:37,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:37,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235083946] [2021-10-28 09:16:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:37,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,400 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-28 09:16:37,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:37,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235083946] [2021-10-28 09:16:37,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235083946] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:37,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:37,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:16:37,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541691512] [2021-10-28 09:16:37,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:37,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:37,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:37,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:37,407 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-28 09:16:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:37,501 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2021-10-28 09:16:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:37,502 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-28 09:16:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:37,506 INFO L225 Difference]: With dead ends: 363 [2021-10-28 09:16:37,515 INFO L226 Difference]: Without dead ends: 232 [2021-10-28 09:16:37,517 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-10-28 09:16:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2021-10-28 09:16:37,575 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-28 09:16:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2021-10-28 09:16:37,585 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2021-10-28 09:16:37,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:37,586 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2021-10-28 09:16:37,586 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-28 09:16:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2021-10-28 09:16:37,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:37,590 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:37,591 INFO L513 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-28 09:16:37,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:16:37,592 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:37,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:37,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2021-10-28 09:16:37,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:37,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918916351] [2021-10-28 09:16:37,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:37,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,661 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-28 09:16:37,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:37,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918916351] [2021-10-28 09:16:37,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918916351] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:37,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:37,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:16:37,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750271973] [2021-10-28 09:16:37,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:37,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:37,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:37,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:37,666 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-28 09:16:37,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:37,729 INFO L93 Difference]: Finished difference Result 453 states and 673 transitions. [2021-10-28 09:16:37,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:37,737 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-28 09:16:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:37,740 INFO L225 Difference]: With dead ends: 453 [2021-10-28 09:16:37,740 INFO L226 Difference]: Without dead ends: 230 [2021-10-28 09:16:37,741 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-28 09:16:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-10-28 09:16:37,793 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-28 09:16:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 333 transitions. [2021-10-28 09:16:37,796 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 333 transitions. Word has length 39 [2021-10-28 09:16:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:37,796 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 333 transitions. [2021-10-28 09:16:37,797 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-28 09:16:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 333 transitions. [2021-10-28 09:16:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:37,802 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:37,803 INFO L513 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-28 09:16:37,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:16:37,803 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:37,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:37,805 INFO L85 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2021-10-28 09:16:37,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:37,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082620034] [2021-10-28 09:16:37,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:37,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,970 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-28 09:16:37,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:37,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082620034] [2021-10-28 09:16:37,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082620034] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:37,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:37,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:16:37,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241095721] [2021-10-28 09:16:37,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:37,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:37,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:37,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:37,974 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-28 09:16:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:38,042 INFO L93 Difference]: Finished difference Result 452 states and 656 transitions. [2021-10-28 09:16:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:38,044 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-28 09:16:38,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:38,046 INFO L225 Difference]: With dead ends: 452 [2021-10-28 09:16:38,047 INFO L226 Difference]: Without dead ends: 230 [2021-10-28 09:16:38,052 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-10-28 09:16:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-10-28 09:16:38,087 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-28 09:16:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2021-10-28 09:16:38,089 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 39 [2021-10-28 09:16:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:38,089 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2021-10-28 09:16:38,090 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-28 09:16:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2021-10-28 09:16:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:38,097 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:38,098 INFO L513 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-28 09:16:38,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:16:38,098 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:38,100 INFO L85 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2021-10-28 09:16:38,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:38,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559230191] [2021-10-28 09:16:38,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:38,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:38,177 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-28 09:16:38,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:38,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559230191] [2021-10-28 09:16:38,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559230191] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:38,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:38,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:38,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913261880] [2021-10-28 09:16:38,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:38,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:38,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:38,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:38,180 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-28 09:16:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:38,349 INFO L93 Difference]: Finished difference Result 598 states and 833 transitions. [2021-10-28 09:16:38,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:16:38,350 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-28 09:16:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:38,353 INFO L225 Difference]: With dead ends: 598 [2021-10-28 09:16:38,353 INFO L226 Difference]: Without dead ends: 377 [2021-10-28 09:16:38,354 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:38,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-10-28 09:16:38,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 230. [2021-10-28 09:16:38,384 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-28 09:16:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 316 transitions. [2021-10-28 09:16:38,386 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 316 transitions. Word has length 39 [2021-10-28 09:16:38,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:38,387 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 316 transitions. [2021-10-28 09:16:38,388 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-28 09:16:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 316 transitions. [2021-10-28 09:16:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:16:38,391 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:38,392 INFO L513 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-28 09:16:38,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:16:38,392 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:38,394 INFO L85 PathProgramCache]: Analyzing trace with hash -50403306, now seen corresponding path program 1 times [2021-10-28 09:16:38,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:38,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734862554] [2021-10-28 09:16:38,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:38,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:38,465 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-28 09:16:38,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:38,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734862554] [2021-10-28 09:16:38,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734862554] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:38,467 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:38,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:38,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810791033] [2021-10-28 09:16:38,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:38,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:38,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:38,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:38,469 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-28 09:16:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:38,643 INFO L93 Difference]: Finished difference Result 784 states and 1078 transitions. [2021-10-28 09:16:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:16:38,644 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-28 09:16:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:38,658 INFO L225 Difference]: With dead ends: 784 [2021-10-28 09:16:38,659 INFO L226 Difference]: Without dead ends: 565 [2021-10-28 09:16:38,663 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:38,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-10-28 09:16:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 519. [2021-10-28 09:16:38,730 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-28 09:16:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 699 transitions. [2021-10-28 09:16:38,733 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 699 transitions. Word has length 39 [2021-10-28 09:16:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:38,736 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 699 transitions. [2021-10-28 09:16:38,736 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-28 09:16:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 699 transitions. [2021-10-28 09:16:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 09:16:38,740 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:38,740 INFO L513 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-28 09:16:38,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:16:38,741 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:38,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:38,742 INFO L85 PathProgramCache]: Analyzing trace with hash 23055374, now seen corresponding path program 1 times [2021-10-28 09:16:38,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:38,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794996427] [2021-10-28 09:16:38,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:38,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:38,816 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-28 09:16:38,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:38,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794996427] [2021-10-28 09:16:38,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794996427] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:38,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:38,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:16:38,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771130634] [2021-10-28 09:16:38,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:16:38,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:38,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:16:38,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:38,820 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-28 09:16:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:38,990 INFO L93 Difference]: Finished difference Result 1311 states and 1775 transitions. [2021-10-28 09:16:38,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:16:38,991 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-28 09:16:38,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:38,998 INFO L225 Difference]: With dead ends: 1311 [2021-10-28 09:16:38,998 INFO L226 Difference]: Without dead ends: 813 [2021-10-28 09:16:38,999 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:16:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-10-28 09:16:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 540. [2021-10-28 09:16:39,053 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-28 09:16:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 711 transitions. [2021-10-28 09:16:39,058 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 711 transitions. Word has length 51 [2021-10-28 09:16:39,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:39,058 INFO L470 AbstractCegarLoop]: Abstraction has 540 states and 711 transitions. [2021-10-28 09:16:39,059 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-28 09:16:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 711 transitions. [2021-10-28 09:16:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 09:16:39,060 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:39,060 INFO L513 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-28 09:16:39,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:16:39,061 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:39,062 INFO L85 PathProgramCache]: Analyzing trace with hash 724655248, now seen corresponding path program 1 times [2021-10-28 09:16:39,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:39,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279930476] [2021-10-28 09:16:39,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:39,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:39,141 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-28 09:16:39,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:39,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279930476] [2021-10-28 09:16:39,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279930476] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:39,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:39,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:39,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946420758] [2021-10-28 09:16:39,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:39,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:39,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:39,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:39,146 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-28 09:16:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:39,306 INFO L93 Difference]: Finished difference Result 1511 states and 1975 transitions. [2021-10-28 09:16:39,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:39,306 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-28 09:16:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:39,314 INFO L225 Difference]: With dead ends: 1511 [2021-10-28 09:16:39,315 INFO L226 Difference]: Without dead ends: 996 [2021-10-28 09:16:39,317 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:39,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-10-28 09:16:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 960. [2021-10-28 09:16:39,421 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-28 09:16:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1226 transitions. [2021-10-28 09:16:39,426 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1226 transitions. Word has length 51 [2021-10-28 09:16:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:39,427 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 1226 transitions. [2021-10-28 09:16:39,427 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-28 09:16:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1226 transitions. [2021-10-28 09:16:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-28 09:16:39,428 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:39,429 INFO L513 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-28 09:16:39,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:16:39,429 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash 171160657, now seen corresponding path program 1 times [2021-10-28 09:16:39,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:39,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115372339] [2021-10-28 09:16:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:39,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:39,483 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-28 09:16:39,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:39,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115372339] [2021-10-28 09:16:39,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115372339] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:39,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:39,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 09:16:39,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10737997] [2021-10-28 09:16:39,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:39,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:39,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:39,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:39,487 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-28 09:16:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:39,692 INFO L93 Difference]: Finished difference Result 2284 states and 2945 transitions. [2021-10-28 09:16:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:39,693 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-28 09:16:39,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:39,705 INFO L225 Difference]: With dead ends: 2284 [2021-10-28 09:16:39,705 INFO L226 Difference]: Without dead ends: 1602 [2021-10-28 09:16:39,707 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2021-10-28 09:16:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1312. [2021-10-28 09:16:39,850 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-28 09:16:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1678 transitions. [2021-10-28 09:16:39,857 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1678 transitions. Word has length 52 [2021-10-28 09:16:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:39,858 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 1678 transitions. [2021-10-28 09:16:39,858 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-28 09:16:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1678 transitions. [2021-10-28 09:16:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 09:16:39,860 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:39,861 INFO L513 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-28 09:16:39,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:16:39,861 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:39,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash 313852773, now seen corresponding path program 1 times [2021-10-28 09:16:39,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:39,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648259715] [2021-10-28 09:16:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:39,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:39,943 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-28 09:16:39,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:39,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648259715] [2021-10-28 09:16:39,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648259715] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:39,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:39,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:16:39,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067191886] [2021-10-28 09:16:39,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:16:39,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:39,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:16:39,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:39,947 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-28 09:16:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:40,225 INFO L93 Difference]: Finished difference Result 2538 states and 3250 transitions. [2021-10-28 09:16:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:16:40,226 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-28 09:16:40,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:40,242 INFO L225 Difference]: With dead ends: 2538 [2021-10-28 09:16:40,242 INFO L226 Difference]: Without dead ends: 1554 [2021-10-28 09:16:40,245 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:16:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2021-10-28 09:16:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1324. [2021-10-28 09:16:40,393 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-28 09:16:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1656 transitions. [2021-10-28 09:16:40,400 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1656 transitions. Word has length 63 [2021-10-28 09:16:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:40,401 INFO L470 AbstractCegarLoop]: Abstraction has 1324 states and 1656 transitions. [2021-10-28 09:16:40,401 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-28 09:16:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1656 transitions. [2021-10-28 09:16:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 09:16:40,403 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:40,404 INFO L513 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-28 09:16:40,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:16:40,404 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:40,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:40,405 INFO L85 PathProgramCache]: Analyzing trace with hash 736554599, now seen corresponding path program 1 times [2021-10-28 09:16:40,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:40,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332188524] [2021-10-28 09:16:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:40,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:40,515 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-28 09:16:40,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:40,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332188524] [2021-10-28 09:16:40,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332188524] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:40,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:40,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:40,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064071726] [2021-10-28 09:16:40,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:40,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:40,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:40,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:40,519 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-28 09:16:40,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:40,822 INFO L93 Difference]: Finished difference Result 3688 states and 4602 transitions. [2021-10-28 09:16:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:40,823 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-28 09:16:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:40,840 INFO L225 Difference]: With dead ends: 3688 [2021-10-28 09:16:40,840 INFO L226 Difference]: Without dead ends: 2410 [2021-10-28 09:16:40,844 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2021-10-28 09:16:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2384. [2021-10-28 09:16:41,146 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-28 09:16:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 2930 transitions. [2021-10-28 09:16:41,158 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 2930 transitions. Word has length 63 [2021-10-28 09:16:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:41,159 INFO L470 AbstractCegarLoop]: Abstraction has 2384 states and 2930 transitions. [2021-10-28 09:16:41,159 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-28 09:16:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 2930 transitions. [2021-10-28 09:16:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-28 09:16:41,161 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:41,162 INFO L513 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-28 09:16:41,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:16:41,162 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1397696040, now seen corresponding path program 1 times [2021-10-28 09:16:41,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:41,163 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054961074] [2021-10-28 09:16:41,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:41,164 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:41,212 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-28 09:16:41,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:41,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054961074] [2021-10-28 09:16:41,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054961074] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:41,213 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:41,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:16:41,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792770382] [2021-10-28 09:16:41,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:41,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:41,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:41,216 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-28 09:16:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:41,530 INFO L93 Difference]: Finished difference Result 4188 states and 5143 transitions. [2021-10-28 09:16:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:16:41,531 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-28 09:16:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:41,544 INFO L225 Difference]: With dead ends: 4188 [2021-10-28 09:16:41,544 INFO L226 Difference]: Without dead ends: 1829 [2021-10-28 09:16:41,550 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2021-10-28 09:16:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2021-10-28 09:16:41,748 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-28 09:16:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2207 transitions. [2021-10-28 09:16:41,757 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2207 transitions. Word has length 64 [2021-10-28 09:16:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:41,758 INFO L470 AbstractCegarLoop]: Abstraction has 1829 states and 2207 transitions. [2021-10-28 09:16:41,758 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-28 09:16:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2207 transitions. [2021-10-28 09:16:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 09:16:41,761 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:41,761 INFO L513 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-28 09:16:41,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:16:41,762 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1733249900, now seen corresponding path program 1 times [2021-10-28 09:16:41,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:41,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455555263] [2021-10-28 09:16:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:41,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:41,821 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-28 09:16:41,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:41,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455555263] [2021-10-28 09:16:41,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455555263] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:41,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:41,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:16:41,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972522781] [2021-10-28 09:16:41,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:41,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:41,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:41,825 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-28 09:16:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:42,086 INFO L93 Difference]: Finished difference Result 3653 states and 4407 transitions. [2021-10-28 09:16:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:16:42,087 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-28 09:16:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:42,098 INFO L225 Difference]: With dead ends: 3653 [2021-10-28 09:16:42,099 INFO L226 Difference]: Without dead ends: 1582 [2021-10-28 09:16:42,103 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2021-10-28 09:16:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1559. [2021-10-28 09:16:42,248 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-28 09:16:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1866 transitions. [2021-10-28 09:16:42,256 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1866 transitions. Word has length 94 [2021-10-28 09:16:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:42,256 INFO L470 AbstractCegarLoop]: Abstraction has 1559 states and 1866 transitions. [2021-10-28 09:16:42,256 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-28 09:16:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1866 transitions. [2021-10-28 09:16:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 09:16:42,259 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:42,259 INFO L513 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-28 09:16:42,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:16:42,260 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash -41173677, now seen corresponding path program 1 times [2021-10-28 09:16:42,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:42,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481789014] [2021-10-28 09:16:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:42,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:42,314 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-28 09:16:42,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:42,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481789014] [2021-10-28 09:16:42,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481789014] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:42,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:42,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:16:42,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935061030] [2021-10-28 09:16:42,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:42,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:42,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:42,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:42,318 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-28 09:16:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:42,500 INFO L93 Difference]: Finished difference Result 2548 states and 3026 transitions. [2021-10-28 09:16:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:16:42,501 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-28 09:16:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:42,506 INFO L225 Difference]: With dead ends: 2548 [2021-10-28 09:16:42,506 INFO L226 Difference]: Without dead ends: 699 [2021-10-28 09:16:42,509 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:16:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-10-28 09:16:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2021-10-28 09:16:42,576 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-28 09:16:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 777 transitions. [2021-10-28 09:16:42,579 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 777 transitions. Word has length 94 [2021-10-28 09:16:42,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:42,580 INFO L470 AbstractCegarLoop]: Abstraction has 699 states and 777 transitions. [2021-10-28 09:16:42,580 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-28 09:16:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 777 transitions. [2021-10-28 09:16:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-28 09:16:42,582 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:42,582 INFO L513 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-28 09:16:42,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:16:42,583 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash -400908240, now seen corresponding path program 1 times [2021-10-28 09:16:42,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:42,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011248435] [2021-10-28 09:16:42,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:42,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:42,627 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-28 09:16:42,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:42,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011248435] [2021-10-28 09:16:42,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011248435] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:42,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:42,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:16:42,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226235752] [2021-10-28 09:16:42,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:16:42,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:42,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:16:42,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:42,631 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-28 09:16:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:42,723 INFO L93 Difference]: Finished difference Result 1019 states and 1137 transitions. [2021-10-28 09:16:42,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:16:42,724 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-28 09:16:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:42,729 INFO L225 Difference]: With dead ends: 1019 [2021-10-28 09:16:42,729 INFO L226 Difference]: Without dead ends: 582 [2021-10-28 09:16:42,732 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:16:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-10-28 09:16:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2021-10-28 09:16:42,786 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-28 09:16:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2021-10-28 09:16:42,789 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 94 [2021-10-28 09:16:42,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:42,790 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2021-10-28 09:16:42,790 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-28 09:16:42,790 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2021-10-28 09:16:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-28 09:16:42,792 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:42,792 INFO L513 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-28 09:16:42,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:16:42,792 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:16:42,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:42,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1944009862, now seen corresponding path program 1 times [2021-10-28 09:16:42,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:42,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839855047] [2021-10-28 09:16:42,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:42,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:42,953 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-28 09:16:42,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:42,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839855047] [2021-10-28 09:16:42,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839855047] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:42,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:42,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:16:42,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689387720] [2021-10-28 09:16:42,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:16:42,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:42,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:16:42,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:42,956 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-28 09:16:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:43,044 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2021-10-28 09:16:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:16:43,044 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-28 09:16:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:43,045 INFO L225 Difference]: With dead ends: 586 [2021-10-28 09:16:43,045 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 09:16:43,046 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:16:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 09:16:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 09:16:43,047 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-28 09:16:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 09:16:43,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-10-28 09:16:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:43,048 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:16:43,048 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-28 09:16:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 09:16:43,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 09:16:43,051 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:16:43,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:16:43,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 09:16:43,066 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,908 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:43,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,913 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:44,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:45,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:16:59,080 INFO L857 garLoopResultBuilder]: For program point L135(lines 135 144) no Hoare annotation was computed. [2021-10-28 09:16:59,080 INFO L857 garLoopResultBuilder]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2021-10-28 09:16:59,080 INFO L857 garLoopResultBuilder]: For program point L36(lines 36 44) no Hoare annotation was computed. [2021-10-28 09:16:59,081 INFO L857 garLoopResultBuilder]: For program point L135-3(lines 135 144) no Hoare annotation was computed. [2021-10-28 09:16:59,081 INFO L857 garLoopResultBuilder]: For program point L135-5(lines 135 144) no Hoare annotation was computed. [2021-10-28 09:16:59,081 INFO L857 garLoopResultBuilder]: For program point L135-6(lines 135 144) no Hoare annotation was computed. [2021-10-28 09:16:59,081 INFO L857 garLoopResultBuilder]: For program point L135-8(lines 135 144) no Hoare annotation was computed. [2021-10-28 09:16:59,081 INFO L857 garLoopResultBuilder]: For program point L135-9(lines 135 144) no Hoare annotation was computed. [2021-10-28 09:16:59,082 INFO L857 garLoopResultBuilder]: For program point L135-11(lines 135 144) no Hoare annotation was computed. [2021-10-28 09:16:59,082 INFO L857 garLoopResultBuilder]: For program point L135-12(lines 135 144) no Hoare annotation was computed. [2021-10-28 09:16:59,082 INFO L857 garLoopResultBuilder]: For program point L135-14(lines 135 144) no Hoare annotation was computed. [2021-10-28 09:16:59,082 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 141) no Hoare annotation was computed. [2021-10-28 09:16:59,082 INFO L857 garLoopResultBuilder]: For program point L136-1(lines 136 141) no Hoare annotation was computed. [2021-10-28 09:16:59,083 INFO L857 garLoopResultBuilder]: For program point L136-2(lines 136 141) no Hoare annotation was computed. [2021-10-28 09:16:59,083 INFO L857 garLoopResultBuilder]: For program point L136-3(lines 136 141) no Hoare annotation was computed. [2021-10-28 09:16:59,083 INFO L857 garLoopResultBuilder]: For program point L136-4(lines 136 141) no Hoare annotation was computed. [2021-10-28 09:16:59,084 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-28 09:16:59,084 INFO L857 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2021-10-28 09:16:59,084 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-28 09:16:59,085 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-10-28 09:16:59,085 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-28 09:16:59,085 INFO L857 garLoopResultBuilder]: For program point L207(lines 207 211) no Hoare annotation was computed. [2021-10-28 09:16:59,085 INFO L857 garLoopResultBuilder]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2021-10-28 09:16:59,086 INFO L857 garLoopResultBuilder]: For program point L439(lines 439 448) no Hoare annotation was computed. [2021-10-28 09:16:59,086 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-28 09:16:59,086 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-28 09:16:59,087 INFO L853 garLoopResultBuilder]: At program point L473(lines 464 475) the Hoare annotation is: (= ~t1_i~0 1) [2021-10-28 09:16:59,087 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-28 09:16:59,087 INFO L857 garLoopResultBuilder]: For program point L311(lines 311 315) no Hoare annotation was computed. [2021-10-28 09:16:59,087 INFO L857 garLoopResultBuilder]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2021-10-28 09:16:59,087 INFO L857 garLoopResultBuilder]: For program point L311-3(lines 311 315) no Hoare annotation was computed. [2021-10-28 09:16:59,088 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-28 09:16:59,088 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-28 09:16:59,088 INFO L857 garLoopResultBuilder]: For program point L311-5(lines 311 315) no Hoare annotation was computed. [2021-10-28 09:16:59,089 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-28 09:16:59,089 INFO L857 garLoopResultBuilder]: For program point L311-6(lines 311 315) no Hoare annotation was computed. [2021-10-28 09:16:59,089 INFO L857 garLoopResultBuilder]: For program point L80(lines 80 88) no Hoare annotation was computed. [2021-10-28 09:16:59,089 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-28 09:16:59,090 INFO L857 garLoopResultBuilder]: For program point L311-8(lines 311 315) no Hoare annotation was computed. [2021-10-28 09:16:59,090 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-28 09:16:59,090 INFO L857 garLoopResultBuilder]: For program point L311-9(lines 311 315) no Hoare annotation was computed. [2021-10-28 09:16:59,090 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-28 09:16:59,091 INFO L857 garLoopResultBuilder]: For program point L311-11(lines 311 315) no Hoare annotation was computed. [2021-10-28 09:16:59,091 INFO L857 garLoopResultBuilder]: For program point L311-12(lines 311 315) no Hoare annotation was computed. [2021-10-28 09:16:59,091 INFO L857 garLoopResultBuilder]: For program point L311-14(lines 311 315) no Hoare annotation was computed. [2021-10-28 09:16:59,091 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-28 09:16:59,092 INFO L857 garLoopResultBuilder]: For program point L279-1(lines 278 301) no Hoare annotation was computed. [2021-10-28 09:16:59,092 INFO L857 garLoopResultBuilder]: For program point L180(lines 180 190) no Hoare annotation was computed. [2021-10-28 09:16:59,092 INFO L857 garLoopResultBuilder]: For program point L279-3(lines 278 301) no Hoare annotation was computed. [2021-10-28 09:16:59,092 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-28 09:16:59,093 INFO L857 garLoopResultBuilder]: For program point L180-1(lines 180 190) no Hoare annotation was computed. [2021-10-28 09:16:59,093 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-28 09:16:59,093 INFO L857 garLoopResultBuilder]: For program point L180-2(lines 180 190) no Hoare annotation was computed. [2021-10-28 09:16:59,094 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-28 09:16:59,094 INFO L857 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2021-10-28 09:16:59,094 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-28 09:16:59,094 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-28 09:16:59,095 INFO L857 garLoopResultBuilder]: For program point L215(lines 215 222) no Hoare annotation was computed. [2021-10-28 09:16:59,095 INFO L857 garLoopResultBuilder]: For program point L116(lines 116 125) no Hoare annotation was computed. [2021-10-28 09:16:59,095 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 87) no Hoare annotation was computed. [2021-10-28 09:16:59,095 INFO L857 garLoopResultBuilder]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2021-10-28 09:16:59,096 INFO L857 garLoopResultBuilder]: For program point L116-3(lines 116 125) no Hoare annotation was computed. [2021-10-28 09:16:59,096 INFO L857 garLoopResultBuilder]: For program point L116-5(lines 116 125) no Hoare annotation was computed. [2021-10-28 09:16:59,096 INFO L857 garLoopResultBuilder]: For program point L116-6(lines 116 125) no Hoare annotation was computed. [2021-10-28 09:16:59,096 INFO L857 garLoopResultBuilder]: For program point L116-8(lines 116 125) no Hoare annotation was computed. [2021-10-28 09:16:59,096 INFO L857 garLoopResultBuilder]: For program point L116-9(lines 116 125) no Hoare annotation was computed. [2021-10-28 09:16:59,096 INFO L857 garLoopResultBuilder]: For program point L116-11(lines 116 125) no Hoare annotation was computed. [2021-10-28 09:16:59,097 INFO L857 garLoopResultBuilder]: For program point L116-12(lines 116 125) no Hoare annotation was computed. [2021-10-28 09:16:59,097 INFO L857 garLoopResultBuilder]: For program point L116-14(lines 116 125) no Hoare annotation was computed. [2021-10-28 09:16:59,097 INFO L857 garLoopResultBuilder]: For program point L117(lines 117 122) no Hoare annotation was computed. [2021-10-28 09:16:59,097 INFO L857 garLoopResultBuilder]: For program point L117-1(lines 117 122) no Hoare annotation was computed. [2021-10-28 09:16:59,098 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-28 09:16:59,098 INFO L857 garLoopResultBuilder]: For program point L117-2(lines 117 122) no Hoare annotation was computed. [2021-10-28 09:16:59,098 INFO L857 garLoopResultBuilder]: For program point L117-3(lines 117 122) no Hoare annotation was computed. [2021-10-28 09:16:59,098 INFO L857 garLoopResultBuilder]: For program point L117-4(lines 117 122) no Hoare annotation was computed. [2021-10-28 09:16:59,098 INFO L857 garLoopResultBuilder]: For program point L184(lines 184 189) no Hoare annotation was computed. [2021-10-28 09:16:59,099 INFO L857 garLoopResultBuilder]: For program point L184-1(lines 184 189) no Hoare annotation was computed. [2021-10-28 09:16:59,099 INFO L857 garLoopResultBuilder]: For program point L184-2(lines 184 189) no Hoare annotation was computed. [2021-10-28 09:16:59,099 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-28 09:16:59,099 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 09:16:59,099 INFO L857 garLoopResultBuilder]: For program point L284-1(lines 278 301) no Hoare annotation was computed. [2021-10-28 09:16:59,100 INFO L857 garLoopResultBuilder]: For program point L251-1(lines 250 273) no Hoare annotation was computed. [2021-10-28 09:16:59,100 INFO L857 garLoopResultBuilder]: For program point L251-2(lines 251 255) no Hoare annotation was computed. [2021-10-28 09:16:59,100 INFO L857 garLoopResultBuilder]: For program point L284-3(lines 278 301) no Hoare annotation was computed. [2021-10-28 09:16:59,100 INFO L857 garLoopResultBuilder]: For program point L251-4(lines 250 273) no Hoare annotation was computed. [2021-10-28 09:16:59,100 INFO L857 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2021-10-28 09:16:59,101 INFO L857 garLoopResultBuilder]: For program point L352-1(lines 351 374) no Hoare annotation was computed. [2021-10-28 09:16:59,101 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-28 09:16:59,101 INFO L857 garLoopResultBuilder]: For program point L319-3(lines 319 323) no Hoare annotation was computed. [2021-10-28 09:16:59,102 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-28 09:16:59,102 INFO L857 garLoopResultBuilder]: For program point L319-6(lines 319 323) no Hoare annotation was computed. [2021-10-28 09:16:59,102 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-28 09:16:59,102 INFO L857 garLoopResultBuilder]: For program point L319-9(lines 319 323) no Hoare annotation was computed. [2021-10-28 09:16:59,103 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-28 09:16:59,103 INFO L857 garLoopResultBuilder]: For program point L319-12(lines 319 323) no Hoare annotation was computed. [2021-10-28 09:16:59,103 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-28 09:16:59,103 INFO L857 garLoopResultBuilder]: For program point L452(lines 452 456) no Hoare annotation was computed. [2021-10-28 09:16:59,104 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-28 09:16:59,104 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-28 09:16:59,104 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-28 09:16:59,105 INFO L857 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2021-10-28 09:16:59,105 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 09:16:59,105 INFO L857 garLoopResultBuilder]: For program point L289-1(lines 278 301) no Hoare annotation was computed. [2021-10-28 09:16:59,105 INFO L857 garLoopResultBuilder]: For program point L256-1(lines 250 273) no Hoare annotation was computed. [2021-10-28 09:16:59,106 INFO L857 garLoopResultBuilder]: For program point L289-3(lines 278 301) no Hoare annotation was computed. [2021-10-28 09:16:59,106 INFO L857 garLoopResultBuilder]: For program point L256-3(lines 250 273) no Hoare annotation was computed. [2021-10-28 09:16:59,106 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-28 09:16:59,106 INFO L857 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2021-10-28 09:16:59,106 INFO L857 garLoopResultBuilder]: For program point L357-1(lines 351 374) no Hoare annotation was computed. [2021-10-28 09:16:59,107 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-28 09:16:59,107 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-28 09:16:59,108 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-28 09:16:59,108 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-28 09:16:59,108 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-28 09:16:59,109 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-28 09:16:59,109 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-28 09:16:59,110 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-28 09:16:59,110 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-28 09:16:59,110 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-28 09:16:59,110 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-28 09:16:59,111 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 09:16:59,111 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-28 09:16:59,111 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-28 09:16:59,112 INFO L853 garLoopResultBuilder]: At program point L458(lines 405 463) the Hoare annotation is: (= ~t1_i~0 1) [2021-10-28 09:16:59,112 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-28 09:16:59,112 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-28 09:16:59,112 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-28 09:16:59,113 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-28 09:16:59,113 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-28 09:16:59,113 INFO L857 garLoopResultBuilder]: For program point L261-1(lines 250 273) no Hoare annotation was computed. [2021-10-28 09:16:59,114 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-28 09:16:59,114 INFO L857 garLoopResultBuilder]: For program point L261-3(lines 250 273) no Hoare annotation was computed. [2021-10-28 09:16:59,114 INFO L857 garLoopResultBuilder]: For program point L162-1(lines 161 174) no Hoare annotation was computed. [2021-10-28 09:16:59,114 INFO L857 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2021-10-28 09:16:59,115 INFO L857 garLoopResultBuilder]: For program point L229(lines 229 236) no Hoare annotation was computed. [2021-10-28 09:16:59,115 INFO L857 garLoopResultBuilder]: For program point L362-1(lines 351 374) no Hoare annotation was computed. [2021-10-28 09:16:59,115 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 09:16:59,115 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-28 09:16:59,116 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-28 09:16:59,116 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-28 09:16:59,116 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-28 09:16:59,120 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:16:59,122 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:16:59,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:16:59 BoogieIcfgContainer [2021-10-28 09:16:59,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:16:59,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:16:59,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:16:59,259 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:16:59,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:16:36" (3/4) ... [2021-10-28 09:16:59,264 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 09:16:59,293 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 09:16:59,295 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 09:16:59,296 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:16:59,297 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:16:59,331 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-28 09:16:59,333 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-28 09:16:59,333 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-28 09:16:59,333 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-28 09:16:59,334 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-28 09:16:59,335 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-28 09:16:59,335 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-28 09:16:59,335 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-28 09:16:59,336 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-28 09:16:59,336 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-28 09:16:59,337 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-28 09:16:59,338 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-28 09:16:59,339 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-28 09:16:59,339 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-28 09:16:59,339 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-28 09:16:59,340 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-28 09:16:59,341 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-28 09:16:59,341 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-28 09:16:59,342 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-28 09:16:59,343 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-28 09:16:59,343 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-28 09:16:59,343 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-28 09:16:59,344 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-28 09:16:59,344 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-28 09:16:59,348 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-28 09:16:59,349 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-28 09:16:59,349 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-28 09:16:59,352 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-28 09:16:59,352 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-28 09:16:59,353 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-28 09:16:59,353 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-28 09:16:59,353 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-28 09:16:59,354 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-28 09:16:59,355 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-28 09:16:59,355 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-28 09:16:59,355 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-28 09:16:59,356 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-28 09:16:59,356 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-28 09:16:59,356 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-28 09:16:59,356 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-28 09:16:59,357 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-28 09:16:59,357 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-28 09:16:59,360 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-28 09:16:59,445 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:16:59,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:16:59,447 INFO L168 Benchmark]: Toolchain (without parser) took 24310.18 ms. Allocated memory was 94.4 MB in the beginning and 310.4 MB in the end (delta: 216.0 MB). Free memory was 66.5 MB in the beginning and 157.1 MB in the end (delta: -90.7 MB). Peak memory consumption was 126.7 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:59,448 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 94.4 MB. Free memory is still 62.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:16:59,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.09 ms. Allocated memory is still 94.4 MB. Free memory was 66.3 MB in the beginning and 54.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:59,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.13 ms. Allocated memory is still 94.4 MB. Free memory was 54.3 MB in the beginning and 51.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:59,450 INFO L168 Benchmark]: Boogie Preprocessor took 48.77 ms. Allocated memory is still 94.4 MB. Free memory was 51.6 MB in the beginning and 49.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:59,451 INFO L168 Benchmark]: RCFGBuilder took 1144.59 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 49.7 MB in the beginning and 83.4 MB in the end (delta: -33.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:59,452 INFO L168 Benchmark]: TraceAbstraction took 22480.03 ms. Allocated memory was 113.2 MB in the beginning and 310.4 MB in the end (delta: 197.1 MB). Free memory was 82.8 MB in the beginning and 167.7 MB in the end (delta: -84.9 MB). Peak memory consumption was 182.6 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:59,453 INFO L168 Benchmark]: Witness Printer took 186.69 ms. Allocated memory is still 310.4 MB. Free memory was 167.7 MB in the beginning and 157.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:16:59,460 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.29 ms. Allocated memory is still 94.4 MB. Free memory is still 62.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 374.09 ms. Allocated memory is still 94.4 MB. Free memory was 66.3 MB in the beginning and 54.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 68.13 ms. Allocated memory is still 94.4 MB. Free memory was 54.3 MB in the beginning and 51.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.77 ms. Allocated memory is still 94.4 MB. Free memory was 51.6 MB in the beginning and 49.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1144.59 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 49.7 MB in the beginning and 83.4 MB in the end (delta: -33.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22480.03 ms. Allocated memory was 113.2 MB in the beginning and 310.4 MB in the end (delta: 197.1 MB). Free memory was 82.8 MB in the beginning and 167.7 MB in the end (delta: -84.9 MB). Peak memory consumption was 182.6 MB. Max. memory is 16.1 GB. * Witness Printer took 186.69 ms. Allocated memory is still 310.4 MB. Free memory was 167.7 MB in the beginning and 157.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.5 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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: 22.2s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3179 SDtfs, 3877 SDslu, 2598 SDs, 0 SdLazy, 401 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 1073 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 754 NumberOfFragments, 11288 HoareAnnotationTreeSize, 52 FomulaSimplifications, 76100 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 52 FomulaSimplificationsInter, 27888 FormulaSimplificationTreeSizeReductionInter, 13.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s 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-28 09:16:59,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aa63b97-922d-4f08-8118-060b4d41dd55/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...