./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 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/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_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G --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 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 13:37:13,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 13:37:13,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 13:37:13,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 13:37:13,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 13:37:13,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 13:37:13,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 13:37:13,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 13:37:13,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 13:37:13,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 13:37:13,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 13:37:13,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 13:37:13,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 13:37:13,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 13:37:13,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 13:37:13,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 13:37:13,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 13:37:13,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 13:37:13,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 13:37:13,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 13:37:13,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 13:37:13,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 13:37:13,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 13:37:13,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 13:37:13,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 13:37:13,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 13:37:13,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 13:37:13,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 13:37:13,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 13:37:13,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 13:37:13,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 13:37:13,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 13:37:13,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 13:37:13,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 13:37:13,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 13:37:13,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 13:37:13,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 13:37:13,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 13:37:13,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 13:37:13,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 13:37:13,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 13:37:13,859 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-23 13:37:13,895 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 13:37:13,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 13:37:13,896 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 13:37:13,897 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 13:37:13,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 13:37:13,899 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 13:37:13,899 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 13:37:13,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 13:37:13,900 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 13:37:13,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 13:37:13,900 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 13:37:13,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 13:37:13,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 13:37:13,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 13:37:13,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 13:37:13,902 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 13:37:13,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 13:37:13,903 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 13:37:13,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 13:37:13,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 13:37:13,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 13:37:13,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 13:37:13,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:37:13,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 13:37:13,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 13:37:13,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 13:37:13,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 13:37:13,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 13:37:13,906 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 13:37:13,907 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 13:37:13,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 13:37:13,907 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 13:37:13,907 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_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/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_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2021-11-23 13:37:14,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 13:37:14,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 13:37:14,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 13:37:14,324 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 13:37:14,325 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 13:37:14,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-11-23 13:37:14,404 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/data/b4262baf7/ef79f6a1a4fb4478a64d8f75758b9fad/FLAGf2c8ba69c [2021-11-23 13:37:14,989 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 13:37:14,989 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-11-23 13:37:15,001 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/data/b4262baf7/ef79f6a1a4fb4478a64d8f75758b9fad/FLAGf2c8ba69c [2021-11-23 13:37:15,313 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/data/b4262baf7/ef79f6a1a4fb4478a64d8f75758b9fad [2021-11-23 13:37:15,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 13:37:15,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 13:37:15,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 13:37:15,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 13:37:15,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 13:37:15,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d41f38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15, skipping insertion in model container [2021-11-23 13:37:15,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 13:37:15,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 13:37:15,603 WARN L230 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_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2021-11-23 13:37:15,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:37:15,693 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 13:37:15,709 WARN L230 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_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[671,684] [2021-11-23 13:37:15,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:37:15,782 INFO L208 MainTranslator]: Completed translation [2021-11-23 13:37:15,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15 WrapperNode [2021-11-23 13:37:15,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 13:37:15,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 13:37:15,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 13:37:15,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 13:37:15,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,890 INFO L137 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 29, calls inlined = 38, statements flattened = 422 [2021-11-23 13:37:15,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 13:37:15,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 13:37:15,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 13:37:15,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 13:37:15,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 13:37:15,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 13:37:15,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 13:37:15,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 13:37:15,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15" (1/1) ... [2021-11-23 13:37:15,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:37:16,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:37:16,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 13:37:16,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 13:37:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 13:37:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 13:37:16,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 13:37:16,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 13:37:16,184 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 13:37:16,185 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 13:37:16,680 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 13:37:16,703 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 13:37:16,704 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 13:37:16,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:37:16 BoogieIcfgContainer [2021-11-23 13:37:16,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 13:37:16,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 13:37:16,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 13:37:16,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 13:37:16,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:37:15" (1/3) ... [2021-11-23 13:37:16,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e465ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:37:16, skipping insertion in model container [2021-11-23 13:37:16,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:37:15" (2/3) ... [2021-11-23 13:37:16,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e465ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:37:16, skipping insertion in model container [2021-11-23 13:37:16,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:37:16" (3/3) ... [2021-11-23 13:37:16,723 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-11-23 13:37:16,729 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 13:37:16,729 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 13:37:16,792 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 13:37:16,801 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-11-23 13:37:16,802 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 13:37:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 151 states have (on average 1.5298013245033113) internal successors, (231), 152 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 13:37:16,837 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:16,837 INFO L514 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, 1, 1, 1, 1] [2021-11-23 13:37:16,838 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1004419317, now seen corresponding path program 1 times [2021-11-23 13:37:16,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:16,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393126615] [2021-11-23 13:37:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:16,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:37:17,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:17,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393126615] [2021-11-23 13:37:17,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393126615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:17,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:17,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:37:17,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090823346] [2021-11-23 13:37:17,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:17,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:37:17,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:17,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:37:17,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:37:17,205 INFO L87 Difference]: Start difference. First operand has 153 states, 151 states have (on average 1.5298013245033113) internal successors, (231), 152 states have internal predecessors, (231), 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 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:17,312 INFO L93 Difference]: Finished difference Result 299 states and 453 transitions. [2021-11-23 13:37:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:37:17,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2021-11-23 13:37:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:17,349 INFO L225 Difference]: With dead ends: 299 [2021-11-23 13:37:17,353 INFO L226 Difference]: Without dead ends: 148 [2021-11-23 13:37:17,359 INFO L932 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-11-23 13:37:17,368 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 215 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:17,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 219 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:37:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-23 13:37:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-11-23 13:37:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.469387755102041) internal successors, (216), 147 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2021-11-23 13:37:17,492 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 43 [2021-11-23 13:37:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:17,493 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2021-11-23 13:37:17,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2021-11-23 13:37:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 13:37:17,496 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:17,497 INFO L514 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, 1, 1, 1, 1] [2021-11-23 13:37:17,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 13:37:17,498 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2033778615, now seen corresponding path program 1 times [2021-11-23 13:37:17,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:17,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274036400] [2021-11-23 13:37:17,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:17,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:37:17,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:17,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274036400] [2021-11-23 13:37:17,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274036400] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:17,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:17,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:37:17,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469506467] [2021-11-23 13:37:17,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:17,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:37:17,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:17,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:37:17,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:37:17,573 INFO L87 Difference]: Start difference. First operand 148 states and 216 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:17,664 INFO L93 Difference]: Finished difference Result 389 states and 569 transitions. [2021-11-23 13:37:17,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:37:17,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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 43 [2021-11-23 13:37:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:17,669 INFO L225 Difference]: With dead ends: 389 [2021-11-23 13:37:17,669 INFO L226 Difference]: Without dead ends: 249 [2021-11-23 13:37:17,671 INFO L932 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-11-23 13:37:17,673 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 181 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:17,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 373 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:37:17,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-11-23 13:37:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2021-11-23 13:37:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.4552845528455285) internal successors, (358), 246 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 358 transitions. [2021-11-23 13:37:17,776 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 358 transitions. Word has length 43 [2021-11-23 13:37:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:17,776 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 358 transitions. [2021-11-23 13:37:17,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 358 transitions. [2021-11-23 13:37:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 13:37:17,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:17,782 INFO L514 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, 1, 1, 1, 1] [2021-11-23 13:37:17,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 13:37:17,783 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash -49531913, now seen corresponding path program 1 times [2021-11-23 13:37:17,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:17,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747552070] [2021-11-23 13:37:17,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:17,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:37:17,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:17,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747552070] [2021-11-23 13:37:17,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747552070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:17,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:17,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:37:17,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842300380] [2021-11-23 13:37:17,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:17,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:37:17,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:17,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:37:17,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:37:17,873 INFO L87 Difference]: Start difference. First operand 247 states and 358 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:17,996 INFO L93 Difference]: Finished difference Result 585 states and 848 transitions. [2021-11-23 13:37:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:37:17,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2021-11-23 13:37:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:18,002 INFO L225 Difference]: With dead ends: 585 [2021-11-23 13:37:18,002 INFO L226 Difference]: Without dead ends: 347 [2021-11-23 13:37:18,004 INFO L932 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-11-23 13:37:18,006 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 377 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:18,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 501 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:37:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-11-23 13:37:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 247. [2021-11-23 13:37:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.443089430894309) internal successors, (355), 246 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 355 transitions. [2021-11-23 13:37:18,090 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 355 transitions. Word has length 43 [2021-11-23 13:37:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:18,091 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 355 transitions. [2021-11-23 13:37:18,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 355 transitions. [2021-11-23 13:37:18,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 13:37:18,094 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:18,094 INFO L514 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, 1, 1, 1, 1] [2021-11-23 13:37:18,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 13:37:18,095 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:18,096 INFO L85 PathProgramCache]: Analyzing trace with hash -893537415, now seen corresponding path program 1 times [2021-11-23 13:37:18,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:18,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765595169] [2021-11-23 13:37:18,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:18,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:18,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-11-23 13:37:18,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765595169] [2021-11-23 13:37:18,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765595169] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:18,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:18,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:37:18,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242418818] [2021-11-23 13:37:18,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:18,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:37:18,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:18,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:37:18,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:37:18,154 INFO L87 Difference]: Start difference. First operand 247 states and 355 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:18,314 INFO L93 Difference]: Finished difference Result 568 states and 817 transitions. [2021-11-23 13:37:18,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:37:18,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2021-11-23 13:37:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:18,319 INFO L225 Difference]: With dead ends: 568 [2021-11-23 13:37:18,320 INFO L226 Difference]: Without dead ends: 331 [2021-11-23 13:37:18,327 INFO L932 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-11-23 13:37:18,337 INFO L933 BasicCegarLoop]: 299 mSDtfsCounter, 348 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:18,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 448 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:37:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-11-23 13:37:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 247. [2021-11-23 13:37:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.4308943089430894) internal successors, (352), 246 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 352 transitions. [2021-11-23 13:37:18,377 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 352 transitions. Word has length 43 [2021-11-23 13:37:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:18,377 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 352 transitions. [2021-11-23 13:37:18,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 352 transitions. [2021-11-23 13:37:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 13:37:18,383 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:18,383 INFO L514 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, 1, 1, 1, 1] [2021-11-23 13:37:18,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 13:37:18,384 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:18,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:18,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1157446583, now seen corresponding path program 1 times [2021-11-23 13:37:18,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:18,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233821678] [2021-11-23 13:37:18,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:18,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:37:18,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:18,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233821678] [2021-11-23 13:37:18,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233821678] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:18,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:18,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:37:18,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555867202] [2021-11-23 13:37:18,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:18,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:37:18,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:18,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:37:18,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:37:18,492 INFO L87 Difference]: Start difference. First operand 247 states and 352 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:18,611 INFO L93 Difference]: Finished difference Result 565 states and 806 transitions. [2021-11-23 13:37:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:37:18,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2021-11-23 13:37:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:18,615 INFO L225 Difference]: With dead ends: 565 [2021-11-23 13:37:18,616 INFO L226 Difference]: Without dead ends: 329 [2021-11-23 13:37:18,617 INFO L932 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-11-23 13:37:18,623 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 342 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:18,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 439 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:37:18,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-11-23 13:37:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 247. [2021-11-23 13:37:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.41869918699187) internal successors, (349), 246 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:18,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 349 transitions. [2021-11-23 13:37:18,657 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 349 transitions. Word has length 43 [2021-11-23 13:37:18,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:18,659 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 349 transitions. [2021-11-23 13:37:18,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 349 transitions. [2021-11-23 13:37:18,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 13:37:18,672 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:18,672 INFO L514 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, 1, 1, 1, 1] [2021-11-23 13:37:18,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 13:37:18,674 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:18,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1085060025, now seen corresponding path program 1 times [2021-11-23 13:37:18,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:18,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005381870] [2021-11-23 13:37:18,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:18,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:37:18,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:18,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005381870] [2021-11-23 13:37:18,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005381870] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:18,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:18,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:37:18,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299563585] [2021-11-23 13:37:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:18,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:37:18,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:18,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:37:18,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:37:18,768 INFO L87 Difference]: Start difference. First operand 247 states and 349 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:18,842 INFO L93 Difference]: Finished difference Result 681 states and 964 transitions. [2021-11-23 13:37:18,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:37:18,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 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 43 [2021-11-23 13:37:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:18,847 INFO L225 Difference]: With dead ends: 681 [2021-11-23 13:37:18,847 INFO L226 Difference]: Without dead ends: 447 [2021-11-23 13:37:18,848 INFO L932 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-11-23 13:37:18,851 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 173 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:18,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 353 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:37:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-11-23 13:37:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 421. [2021-11-23 13:37:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3952380952380952) internal successors, (586), 420 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 586 transitions. [2021-11-23 13:37:18,897 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 586 transitions. Word has length 43 [2021-11-23 13:37:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:18,903 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 586 transitions. [2021-11-23 13:37:18,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 586 transitions. [2021-11-23 13:37:18,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-23 13:37:18,908 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:18,909 INFO L514 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, 1, 1, 1, 1, 1] [2021-11-23 13:37:18,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 13:37:18,909 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1696098714, now seen corresponding path program 1 times [2021-11-23 13:37:18,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:18,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378938176] [2021-11-23 13:37:18,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:18,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:37:19,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:19,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378938176] [2021-11-23 13:37:19,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378938176] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:19,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:19,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:37:19,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413173883] [2021-11-23 13:37:19,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:19,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:37:19,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:19,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:37:19,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:37:19,036 INFO L87 Difference]: Start difference. First operand 421 states and 586 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:19,231 INFO L93 Difference]: Finished difference Result 1202 states and 1679 transitions. [2021-11-23 13:37:19,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:37:19,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 69 [2021-11-23 13:37:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:19,240 INFO L225 Difference]: With dead ends: 1202 [2021-11-23 13:37:19,240 INFO L226 Difference]: Without dead ends: 798 [2021-11-23 13:37:19,241 INFO L932 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-11-23 13:37:19,245 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 595 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:19,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [595 Valid, 895 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:37:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-11-23 13:37:19,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 442. [2021-11-23 13:37:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 1.36281179138322) internal successors, (601), 441 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 601 transitions. [2021-11-23 13:37:19,306 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 601 transitions. Word has length 69 [2021-11-23 13:37:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:19,306 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 601 transitions. [2021-11-23 13:37:19,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 601 transitions. [2021-11-23 13:37:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-23 13:37:19,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:19,309 INFO L514 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, 1, 1, 1, 1, 1] [2021-11-23 13:37:19,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 13:37:19,309 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2139999388, now seen corresponding path program 1 times [2021-11-23 13:37:19,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:19,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578961802] [2021-11-23 13:37:19,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:19,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:37:19,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:19,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578961802] [2021-11-23 13:37:19,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578961802] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:19,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:19,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:37:19,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122568256] [2021-11-23 13:37:19,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:19,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:37:19,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:19,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:37:19,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:37:19,412 INFO L87 Difference]: Start difference. First operand 442 states and 601 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:19,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:19,624 INFO L93 Difference]: Finished difference Result 1384 states and 1884 transitions. [2021-11-23 13:37:19,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:37:19,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 69 [2021-11-23 13:37:19,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:19,632 INFO L225 Difference]: With dead ends: 1384 [2021-11-23 13:37:19,633 INFO L226 Difference]: Without dead ends: 961 [2021-11-23 13:37:19,634 INFO L932 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-11-23 13:37:19,635 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 411 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:19,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 583 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:37:19,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2021-11-23 13:37:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 763. [2021-11-23 13:37:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 762 states have (on average 1.358267716535433) internal successors, (1035), 762 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1035 transitions. [2021-11-23 13:37:19,735 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1035 transitions. Word has length 69 [2021-11-23 13:37:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:19,735 INFO L470 AbstractCegarLoop]: Abstraction has 763 states and 1035 transitions. [2021-11-23 13:37:19,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:19,736 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1035 transitions. [2021-11-23 13:37:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-23 13:37:19,737 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:19,737 INFO L514 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, 1, 1, 1, 1, 1] [2021-11-23 13:37:19,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 13:37:19,738 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -934330786, now seen corresponding path program 1 times [2021-11-23 13:37:19,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:19,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37016061] [2021-11-23 13:37:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:19,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:37:19,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:19,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37016061] [2021-11-23 13:37:19,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37016061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:19,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:19,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 13:37:19,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467209455] [2021-11-23 13:37:19,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:19,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 13:37:19,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:19,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 13:37:19,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 13:37:19,790 INFO L87 Difference]: Start difference. First operand 763 states and 1035 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:20,067 INFO L93 Difference]: Finished difference Result 2117 states and 2882 transitions. [2021-11-23 13:37:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:37:20,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 69 [2021-11-23 13:37:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:20,079 INFO L225 Difference]: With dead ends: 2117 [2021-11-23 13:37:20,079 INFO L226 Difference]: Without dead ends: 1377 [2021-11-23 13:37:20,082 INFO L932 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-11-23 13:37:20,085 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 485 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:20,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 887 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:37:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2021-11-23 13:37:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 799. [2021-11-23 13:37:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.330827067669173) internal successors, (1062), 798 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1062 transitions. [2021-11-23 13:37:20,200 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1062 transitions. Word has length 69 [2021-11-23 13:37:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:20,202 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 1062 transitions. [2021-11-23 13:37:20,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1062 transitions. [2021-11-23 13:37:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-23 13:37:20,204 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:20,205 INFO L514 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, 1, 1, 1, 1, 1] [2021-11-23 13:37:20,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 13:37:20,205 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:20,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1419200226, now seen corresponding path program 1 times [2021-11-23 13:37:20,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:20,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6480010] [2021-11-23 13:37:20,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:20,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:37:20,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:20,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6480010] [2021-11-23 13:37:20,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6480010] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:20,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:20,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:37:20,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357326468] [2021-11-23 13:37:20,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:20,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:37:20,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:20,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:37:20,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:37:20,279 INFO L87 Difference]: Start difference. First operand 799 states and 1062 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:20,470 INFO L93 Difference]: Finished difference Result 1906 states and 2535 transitions. [2021-11-23 13:37:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:37:20,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 69 [2021-11-23 13:37:20,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:20,480 INFO L225 Difference]: With dead ends: 1906 [2021-11-23 13:37:20,480 INFO L226 Difference]: Without dead ends: 1133 [2021-11-23 13:37:20,482 INFO L932 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-11-23 13:37:20,483 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 470 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:20,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 343 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:37:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-11-23 13:37:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 799. [2021-11-23 13:37:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 1.3095238095238095) internal successors, (1045), 798 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1045 transitions. [2021-11-23 13:37:20,595 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1045 transitions. Word has length 69 [2021-11-23 13:37:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:20,596 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 1045 transitions. [2021-11-23 13:37:20,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1045 transitions. [2021-11-23 13:37:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-23 13:37:20,604 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:20,605 INFO L514 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, 1, 1, 1, 1, 1] [2021-11-23 13:37:20,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 13:37:20,606 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:20,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash -630187616, now seen corresponding path program 1 times [2021-11-23 13:37:20,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:20,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062816928] [2021-11-23 13:37:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:20,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:37:20,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:20,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062816928] [2021-11-23 13:37:20,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062816928] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:20,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:20,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:37:20,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103332694] [2021-11-23 13:37:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:20,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:37:20,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:20,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:37:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:37:20,676 INFO L87 Difference]: Start difference. First operand 799 states and 1045 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:20,889 INFO L93 Difference]: Finished difference Result 1857 states and 2431 transitions. [2021-11-23 13:37:20,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:37:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 69 [2021-11-23 13:37:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:20,899 INFO L225 Difference]: With dead ends: 1857 [2021-11-23 13:37:20,899 INFO L226 Difference]: Without dead ends: 1085 [2021-11-23 13:37:20,901 INFO L932 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-11-23 13:37:20,902 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 398 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:20,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 365 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:37:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2021-11-23 13:37:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 769. [2021-11-23 13:37:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 768 states have (on average 1.2734375) internal successors, (978), 768 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 978 transitions. [2021-11-23 13:37:21,014 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 978 transitions. Word has length 69 [2021-11-23 13:37:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:21,014 INFO L470 AbstractCegarLoop]: Abstraction has 769 states and 978 transitions. [2021-11-23 13:37:21,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 978 transitions. [2021-11-23 13:37:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-23 13:37:21,016 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:21,017 INFO L514 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, 1, 1, 1, 1, 1] [2021-11-23 13:37:21,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 13:37:21,017 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:21,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:21,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1527580894, now seen corresponding path program 1 times [2021-11-23 13:37:21,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:21,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053102801] [2021-11-23 13:37:21,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:21,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-23 13:37:21,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:21,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053102801] [2021-11-23 13:37:21,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053102801] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:21,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:21,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:37:21,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411247187] [2021-11-23 13:37:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:21,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:37:21,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:37:21,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:37:21,105 INFO L87 Difference]: Start difference. First operand 769 states and 978 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:21,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:21,298 INFO L93 Difference]: Finished difference Result 1615 states and 2056 transitions. [2021-11-23 13:37:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:37:21,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 69 [2021-11-23 13:37:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:21,306 INFO L225 Difference]: With dead ends: 1615 [2021-11-23 13:37:21,306 INFO L226 Difference]: Without dead ends: 874 [2021-11-23 13:37:21,308 INFO L932 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-11-23 13:37:21,309 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 347 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:21,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 326 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:37:21,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-11-23 13:37:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 739. [2021-11-23 13:37:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.2344173441734418) internal successors, (911), 738 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 911 transitions. [2021-11-23 13:37:21,414 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 911 transitions. Word has length 69 [2021-11-23 13:37:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:21,414 INFO L470 AbstractCegarLoop]: Abstraction has 739 states and 911 transitions. [2021-11-23 13:37:21,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 911 transitions. [2021-11-23 13:37:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-23 13:37:21,417 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:21,417 INFO L514 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, 1, 1, 1, 1, 1] [2021-11-23 13:37:21,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 13:37:21,417 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:21,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1279434400, now seen corresponding path program 1 times [2021-11-23 13:37:21,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:21,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423981205] [2021-11-23 13:37:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:21,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:37:21,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:21,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423981205] [2021-11-23 13:37:21,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423981205] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:21,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:21,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:37:21,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82739072] [2021-11-23 13:37:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:21,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:37:21,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:21,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:37:21,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:37:21,481 INFO L87 Difference]: Start difference. First operand 739 states and 911 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:21,686 INFO L93 Difference]: Finished difference Result 2055 states and 2539 transitions. [2021-11-23 13:37:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:37:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2021-11-23 13:37:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:21,698 INFO L225 Difference]: With dead ends: 2055 [2021-11-23 13:37:21,699 INFO L226 Difference]: Without dead ends: 1345 [2021-11-23 13:37:21,701 INFO L932 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-11-23 13:37:21,702 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 94 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:21,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 320 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:37:21,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2021-11-23 13:37:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1343. [2021-11-23 13:37:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1342 states have (on average 1.2108792846497765) internal successors, (1625), 1342 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1625 transitions. [2021-11-23 13:37:21,876 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1625 transitions. Word has length 69 [2021-11-23 13:37:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:21,877 INFO L470 AbstractCegarLoop]: Abstraction has 1343 states and 1625 transitions. [2021-11-23 13:37:21,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1625 transitions. [2021-11-23 13:37:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 13:37:21,879 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:21,880 INFO L514 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, 1, 1, 1, 1, 1, 1] [2021-11-23 13:37:21,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 13:37:21,880 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:21,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1424319526, now seen corresponding path program 1 times [2021-11-23 13:37:21,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:21,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202824626] [2021-11-23 13:37:21,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:21,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:37:21,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:21,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202824626] [2021-11-23 13:37:21,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202824626] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:21,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:21,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:37:21,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665974952] [2021-11-23 13:37:21,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:21,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:37:21,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:21,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:37:21,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:37:21,949 INFO L87 Difference]: Start difference. First operand 1343 states and 1625 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:22,288 INFO L93 Difference]: Finished difference Result 3723 states and 4483 transitions. [2021-11-23 13:37:22,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:37:22,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 70 [2021-11-23 13:37:22,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:22,303 INFO L225 Difference]: With dead ends: 3723 [2021-11-23 13:37:22,303 INFO L226 Difference]: Without dead ends: 1851 [2021-11-23 13:37:22,306 INFO L932 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-11-23 13:37:22,308 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 452 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:22,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 591 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:37:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2021-11-23 13:37:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1849. [2021-11-23 13:37:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1848 states have (on average 1.16991341991342) internal successors, (2162), 1848 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2162 transitions. [2021-11-23 13:37:22,535 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 2162 transitions. Word has length 70 [2021-11-23 13:37:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:22,537 INFO L470 AbstractCegarLoop]: Abstraction has 1849 states and 2162 transitions. [2021-11-23 13:37:22,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 2162 transitions. [2021-11-23 13:37:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 13:37:22,541 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:22,541 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2021-11-23 13:37:22,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-23 13:37:22,542 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:22,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash -421424796, now seen corresponding path program 1 times [2021-11-23 13:37:22,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:22,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532555383] [2021-11-23 13:37:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:22,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:37:22,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:22,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532555383] [2021-11-23 13:37:22,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532555383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:22,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:22,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:37:22,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695370521] [2021-11-23 13:37:22,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:22,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:37:22,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:22,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:37:22,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:37:22,592 INFO L87 Difference]: Start difference. First operand 1849 states and 2162 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:22,761 INFO L93 Difference]: Finished difference Result 3132 states and 3659 transitions. [2021-11-23 13:37:22,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:37:22,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 103 [2021-11-23 13:37:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:22,771 INFO L225 Difference]: With dead ends: 3132 [2021-11-23 13:37:22,771 INFO L226 Difference]: Without dead ends: 1312 [2021-11-23 13:37:22,776 INFO L932 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-11-23 13:37:22,778 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 105 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:22,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 400 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:37:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2021-11-23 13:37:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1304. [2021-11-23 13:37:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1303 states have (on average 1.1343054489639295) internal successors, (1478), 1303 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1478 transitions. [2021-11-23 13:37:22,910 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1478 transitions. Word has length 103 [2021-11-23 13:37:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:22,911 INFO L470 AbstractCegarLoop]: Abstraction has 1304 states and 1478 transitions. [2021-11-23 13:37:22,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1478 transitions. [2021-11-23 13:37:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-23 13:37:22,914 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:22,914 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2021-11-23 13:37:22,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-23 13:37:22,915 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:22,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1748151591, now seen corresponding path program 1 times [2021-11-23 13:37:22,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:22,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361998735] [2021-11-23 13:37:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:22,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 13:37:23,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:23,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361998735] [2021-11-23 13:37:23,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361998735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:23,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:23,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:37:23,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257377575] [2021-11-23 13:37:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:23,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:37:23,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:23,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:37:23,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:37:23,048 INFO L87 Difference]: Start difference. First operand 1304 states and 1478 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:23,400 INFO L93 Difference]: Finished difference Result 2726 states and 3085 transitions. [2021-11-23 13:37:23,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:37:23,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 104 [2021-11-23 13:37:23,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:23,419 INFO L225 Difference]: With dead ends: 2726 [2021-11-23 13:37:23,419 INFO L226 Difference]: Without dead ends: 2724 [2021-11-23 13:37:23,420 INFO L932 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-11-23 13:37:23,421 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 225 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:23,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 566 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:37:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2021-11-23 13:37:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 1862. [2021-11-23 13:37:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1861 states have (on average 1.1456206340677055) internal successors, (2132), 1861 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2132 transitions. [2021-11-23 13:37:23,681 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2132 transitions. Word has length 104 [2021-11-23 13:37:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:23,682 INFO L470 AbstractCegarLoop]: Abstraction has 1862 states and 2132 transitions. [2021-11-23 13:37:23,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2132 transitions. [2021-11-23 13:37:23,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-23 13:37:23,688 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:23,688 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:37:23,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-23 13:37:23,689 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:23,690 INFO L85 PathProgramCache]: Analyzing trace with hash 345619627, now seen corresponding path program 1 times [2021-11-23 13:37:23,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:23,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47301977] [2021-11-23 13:37:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:23,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 13:37:23,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:23,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47301977] [2021-11-23 13:37:23,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47301977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:23,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:23,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:37:23,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701558390] [2021-11-23 13:37:23,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:23,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:37:23,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:37:23,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:37:23,756 INFO L87 Difference]: Start difference. First operand 1862 states and 2132 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:24,018 INFO L93 Difference]: Finished difference Result 3120 states and 3603 transitions. [2021-11-23 13:37:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:37:24,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 133 [2021-11-23 13:37:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:24,031 INFO L225 Difference]: With dead ends: 3120 [2021-11-23 13:37:24,032 INFO L226 Difference]: Without dead ends: 1862 [2021-11-23 13:37:24,035 INFO L932 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-11-23 13:37:24,036 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 116 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:24,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 317 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:37:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2021-11-23 13:37:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1862. [2021-11-23 13:37:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1861 states have (on average 1.1284255776464267) internal successors, (2100), 1861 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 2100 transitions. [2021-11-23 13:37:24,289 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 2100 transitions. Word has length 133 [2021-11-23 13:37:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:24,290 INFO L470 AbstractCegarLoop]: Abstraction has 1862 states and 2100 transitions. [2021-11-23 13:37:24,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 2100 transitions. [2021-11-23 13:37:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-23 13:37:24,295 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:37:24,295 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2021-11-23 13:37:24,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-23 13:37:24,296 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:37:24,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:37:24,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1105084102, now seen corresponding path program 2 times [2021-11-23 13:37:24,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:37:24,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603087597] [2021-11-23 13:37:24,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:37:24,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:37:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:37:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 13:37:24,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:37:24,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603087597] [2021-11-23 13:37:24,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603087597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:37:24,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:37:24,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 13:37:24,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867170865] [2021-11-23 13:37:24,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:37:24,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:37:24,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:37:24,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:37:24,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:37:24,372 INFO L87 Difference]: Start difference. First operand 1862 states and 2100 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:37:24,595 INFO L93 Difference]: Finished difference Result 2623 states and 2960 transitions. [2021-11-23 13:37:24,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 13:37:24,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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 134 [2021-11-23 13:37:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:37:24,597 INFO L225 Difference]: With dead ends: 2623 [2021-11-23 13:37:24,597 INFO L226 Difference]: Without dead ends: 0 [2021-11-23 13:37:24,600 INFO L932 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-11-23 13:37:24,601 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 380 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:37:24,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [380 Valid, 603 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 13:37:24,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-23 13:37:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-23 13:37:24,603 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-11-23 13:37:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-23 13:37:24,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2021-11-23 13:37:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:37:24,604 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-23 13:37:24,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:37:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-23 13:37:24,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-23 13:37:24,608 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 13:37:24,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-23 13:37:24,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-23 13:37:54,527 INFO L854 garLoopResultBuilder]: At program point L234(lines 210 248) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,528 INFO L854 garLoopResultBuilder]: At program point L201(lines 184 203) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,529 INFO L854 garLoopResultBuilder]: At program point L201-1(lines 184 203) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,529 INFO L854 garLoopResultBuilder]: At program point L135(lines 123 137) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 ~M_E~0)) (.cse8 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~token~0 ~local~0) .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_st~0 0)) .cse6 .cse7 .cse8))) [2021-11-23 13:37:54,529 INFO L854 garLoopResultBuilder]: At program point L201-2(lines 184 203) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,530 INFO L854 garLoopResultBuilder]: At program point L135-1(lines 123 137) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 0))) (.cse5 (= ~t1_st~0 0)) (.cse9 (= ~token~0 ~local~0)) (.cse10 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0) .cse6 .cse7 .cse8 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0) .cse9 .cse10) (and .cse4 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 (not .cse5) .cse9 .cse10))) [2021-11-23 13:37:54,530 INFO L854 garLoopResultBuilder]: At program point L135-2(lines 123 137) the Hoare annotation is: (let ((.cse8 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (not (= ~E_M~0 0))) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse9 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 0)) (and .cse8 .cse0 .cse1 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse6 .cse7 .cse9 (< ~local~0 ~token~0)) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9))) [2021-11-23 13:37:54,530 INFO L854 garLoopResultBuilder]: At program point L69-1(lines 43 82) the Hoare annotation is: (let ((.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~T1_E~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse9 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not .cse8) .cse9) (and .cse1 .cse2 .cse3 (not .cse0) .cse8 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0) (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0) .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 0) (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0) (= ~token~0 ~local~0) .cse9))) [2021-11-23 13:37:54,530 INFO L854 garLoopResultBuilder]: At program point L135-3(lines 123 137) the Hoare annotation is: (let ((.cse11 (= ~t1_st~0 0))) (let ((.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse9 (not .cse11)) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse12 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse5 (not (= ~E_M~0 0))) (.cse15 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse13 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse14 (= ~token~0 ~local~0)) (.cse10 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 (not .cse0) .cse11 .cse12 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse7 .cse9 (< ~local~0 ~token~0) .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse5 .cse15 .cse6 .cse7 .cse13 .cse14 .cse10)))) [2021-11-23 13:37:54,531 INFO L854 garLoopResultBuilder]: At program point L135-4(lines 123 137) the Hoare annotation is: (let ((.cse11 (= ~t1_st~0 0))) (let ((.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse9 (not .cse11)) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse12 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse5 (not (= ~E_M~0 0))) (.cse15 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse13 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse14 (= ~token~0 ~local~0)) (.cse10 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 (not .cse0) .cse11 .cse12 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse7 .cse9 (< ~local~0 ~token~0) .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse5 .cse15 .cse6 .cse7 .cse13 .cse14 .cse10)))) [2021-11-23 13:37:54,531 INFO L854 garLoopResultBuilder]: At program point L466(lines 413 471) the Hoare annotation is: (= ~t1_i~0 1) [2021-11-23 13:37:54,531 INFO L854 garLoopResultBuilder]: At program point L136(lines 120 138) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= ~m_pc~0 0)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~token~0 ~local~0) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8 .cse9))) [2021-11-23 13:37:54,532 INFO L854 garLoopResultBuilder]: At program point L136-1(lines 120 138) the Hoare annotation is: (let ((.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse9 (= ~t1_st~0 0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 0))) (.cse10 (= ~token~0 ~local~0)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 (not .cse0) .cse5 .cse9 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0) .cse6 .cse7 .cse8 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0) .cse10 .cse11))) [2021-11-23 13:37:54,532 INFO L854 garLoopResultBuilder]: At program point L136-2(lines 120 138) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse10 (not (= ~t1_st~0 0))) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0)))) [2021-11-23 13:37:54,532 INFO L854 garLoopResultBuilder]: At program point L136-3(lines 120 138) the Hoare annotation is: (let ((.cse12 (= ~t1_st~0 0))) (let ((.cse14 (= ~m_pc~0 0)) (.cse13 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse15 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse10 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse16 (not .cse12)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 (not .cse0) .cse5 .cse12 .cse13 .cse6 .cse8 .cse9 .cse14 .cse15 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse14 .cse16 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse8 .cse9 .cse16 (< ~local~0 ~token~0) .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse11)))) [2021-11-23 13:37:54,533 INFO L854 garLoopResultBuilder]: At program point L136-4(lines 120 138) the Hoare annotation is: (let ((.cse12 (= ~t1_st~0 0))) (let ((.cse14 (= ~m_pc~0 0)) (.cse13 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse15 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse10 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse16 (not .cse12)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse4 (not .cse0) .cse5 .cse12 .cse13 .cse6 .cse8 .cse9 .cse14 .cse15 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse14 .cse16 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse8 .cse9 .cse16 (< ~local~0 ~token~0) .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse11)))) [2021-11-23 13:37:54,533 INFO L854 garLoopResultBuilder]: At program point L302-1(lines 283 310) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~E_1~0 ~M_E~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse6 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse10 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse11 (not (= ~E_1~0 0))) (.cse12 (= ~m_pc~0 0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~m_st~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-11-23 13:37:54,533 INFO L858 garLoopResultBuilder]: For program point L269-1(lines 258 281) no Hoare annotation was computed. [2021-11-23 13:37:54,533 INFO L854 garLoopResultBuilder]: At program point L302-3(lines 283 310) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,534 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 174) no Hoare annotation was computed. [2021-11-23 13:37:54,534 INFO L858 garLoopResultBuilder]: For program point L269-3(lines 258 281) no Hoare annotation was computed. [2021-11-23 13:37:54,534 INFO L858 garLoopResultBuilder]: For program point L170-2(lines 169 182) no Hoare annotation was computed. [2021-11-23 13:37:54,534 INFO L858 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2021-11-23 13:37:54,534 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2021-11-23 13:37:54,535 INFO L858 garLoopResultBuilder]: For program point L370-1(lines 359 382) no Hoare annotation was computed. [2021-11-23 13:37:54,535 INFO L854 garLoopResultBuilder]: At program point L274-1(lines 255 282) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~t1_st~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_st~0 0)) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~token~0 ~local~0) .cse7))) [2021-11-23 13:37:54,535 INFO L854 garLoopResultBuilder]: At program point L274-3(lines 255 282) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,536 INFO L854 garLoopResultBuilder]: At program point L175-1(lines 166 183) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~t1_st~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse7 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_st~0 0)) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~token~0 ~local~0) .cse7))) [2021-11-23 13:37:54,536 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 152) no Hoare annotation was computed. [2021-11-23 13:37:54,536 INFO L858 garLoopResultBuilder]: For program point L143-2(lines 143 152) no Hoare annotation was computed. [2021-11-23 13:37:54,536 INFO L854 garLoopResultBuilder]: At program point L77(lines 40 83) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~token~0 ~local~0)) (.cse8 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0) (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0) .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0) .cse7 .cse8))) [2021-11-23 13:37:54,536 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-11-23 13:37:54,537 INFO L858 garLoopResultBuilder]: For program point L143-3(lines 143 152) no Hoare annotation was computed. [2021-11-23 13:37:54,537 INFO L858 garLoopResultBuilder]: For program point L143-5(lines 143 152) no Hoare annotation was computed. [2021-11-23 13:37:54,537 INFO L858 garLoopResultBuilder]: For program point L143-6(lines 143 152) no Hoare annotation was computed. [2021-11-23 13:37:54,537 INFO L858 garLoopResultBuilder]: For program point L143-8(lines 143 152) no Hoare annotation was computed. [2021-11-23 13:37:54,537 INFO L858 garLoopResultBuilder]: For program point L143-9(lines 143 152) no Hoare annotation was computed. [2021-11-23 13:37:54,538 INFO L858 garLoopResultBuilder]: For program point L143-11(lines 143 152) no Hoare annotation was computed. [2021-11-23 13:37:54,538 INFO L858 garLoopResultBuilder]: For program point L143-12(lines 143 152) no Hoare annotation was computed. [2021-11-23 13:37:54,538 INFO L858 garLoopResultBuilder]: For program point L143-14(lines 143 152) no Hoare annotation was computed. [2021-11-23 13:37:54,538 INFO L854 garLoopResultBuilder]: At program point L375-1(lines 356 383) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,539 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2021-11-23 13:37:54,539 INFO L858 garLoopResultBuilder]: For program point L144-1(lines 144 149) no Hoare annotation was computed. [2021-11-23 13:37:54,539 INFO L858 garLoopResultBuilder]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2021-11-23 13:37:54,539 INFO L858 garLoopResultBuilder]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2021-11-23 13:37:54,539 INFO L858 garLoopResultBuilder]: For program point L144-4(lines 144 149) no Hoare annotation was computed. [2021-11-23 13:37:54,540 INFO L854 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,540 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-23 13:37:54,540 INFO L854 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,541 INFO L854 garLoopResultBuilder]: At program point L344(lines 336 346) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~token~0 ~local~0)) (.cse7 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0) (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0) .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0) .cse6 .cse7))) [2021-11-23 13:37:54,541 INFO L854 garLoopResultBuilder]: At program point L344-1(lines 336 346) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse8 (not (= ~t1_st~0 0))) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (not (= ~E_M~0 0))) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse7 .cse8 (< ~local~0 ~token~0)) (and .cse1 .cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse3 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 0)))) [2021-11-23 13:37:54,541 INFO L854 garLoopResultBuilder]: At program point L113(lines 84 119) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse7 (not (= ~m_st~0 0))) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not (= ~t1_st~0 0))) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11))) [2021-11-23 13:37:54,542 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2021-11-23 13:37:54,542 INFO L854 garLoopResultBuilder]: At program point L48(lines 43 82) the Hoare annotation is: (and (= ~t1_pc~0 1) (not (= ~T1_E~0 0)) (= ~t1_i~0 1) (not (= ~T1_E~0 1)) (<= ~token~0 (+ ~local~0 1)) (not (= ~E_M~0 0)) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0) (not (= ~E_M~0 1))) [2021-11-23 13:37:54,542 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2021-11-23 13:37:54,542 INFO L858 garLoopResultBuilder]: For program point L215-1(lines 210 248) no Hoare annotation was computed. [2021-11-23 13:37:54,542 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 456) no Hoare annotation was computed. [2021-11-23 13:37:54,543 INFO L858 garLoopResultBuilder]: For program point L447-2(lines 447 456) no Hoare annotation was computed. [2021-11-23 13:37:54,543 INFO L854 garLoopResultBuilder]: At program point L249(lines 204 254) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,543 INFO L854 garLoopResultBuilder]: At program point L481(lines 472 483) the Hoare annotation is: (= ~t1_i~0 1) [2021-11-23 13:37:54,544 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-23 13:37:54,544 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-11-23 13:37:54,544 INFO L854 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2021-11-23 13:37:54,544 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2021-11-23 13:37:54,544 INFO L858 garLoopResultBuilder]: For program point L319-2(lines 319 323) no Hoare annotation was computed. [2021-11-23 13:37:54,545 INFO L858 garLoopResultBuilder]: For program point L319-3(lines 319 323) no Hoare annotation was computed. [2021-11-23 13:37:54,545 INFO L858 garLoopResultBuilder]: For program point L220(lines 210 248) no Hoare annotation was computed. [2021-11-23 13:37:54,545 INFO L854 garLoopResultBuilder]: At program point L154(lines 142 156) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 ~M_E~0)) (.cse10 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_st~0 0)) .cse8 .cse9 .cse10 .cse11))) [2021-11-23 13:37:54,545 INFO L858 garLoopResultBuilder]: For program point L319-5(lines 319 323) no Hoare annotation was computed. [2021-11-23 13:37:54,546 INFO L854 garLoopResultBuilder]: At program point L154-1(lines 142 156) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T1_E~0 1))) (.cse5 (not (= ~E_M~0 0))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 0))) (.cse4 (= ~t1_st~0 0)) (.cse8 (= ~token~0 ~local~0)) (.cse9 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0) .cse8 .cse9) (and .cse3 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 (not .cse4) .cse8 .cse9))) [2021-11-23 13:37:54,546 INFO L858 garLoopResultBuilder]: For program point L319-6(lines 319 323) no Hoare annotation was computed. [2021-11-23 13:37:54,546 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 96) no Hoare annotation was computed. [2021-11-23 13:37:54,546 INFO L854 garLoopResultBuilder]: At program point L154-2(lines 142 156) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse9 (not (= ~t1_st~0 0))) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (not (= ~E_M~0 0))) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse7 .cse8 .cse9 (< ~local~0 ~token~0)) (and .cse1 .cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse3 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 0) .cse8))) [2021-11-23 13:37:54,546 INFO L858 garLoopResultBuilder]: For program point L319-8(lines 319 323) no Hoare annotation was computed. [2021-11-23 13:37:54,547 INFO L854 garLoopResultBuilder]: At program point L154-3(lines 142 156) the Hoare annotation is: (let ((.cse15 (= ~t1_st~0 0))) (let ((.cse10 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse12 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse13 (= ~m_pc~0 0)) (.cse16 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (not (= ~E_M~0 0))) (.cse14 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse8 (not .cse15)) (.cse9 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 (< ~local~0 ~token~0) .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse4 .cse14 .cse5 .cse6 .cse13 .cse7 .cse9) (and .cse1 .cse2 .cse10 .cse11 .cse3 (not .cse0) .cse12 .cse15 .cse4 .cse5 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse14 .cse5 .cse6 .cse7 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2021-11-23 13:37:54,547 INFO L858 garLoopResultBuilder]: For program point L319-9(lines 319 323) no Hoare annotation was computed. [2021-11-23 13:37:54,547 INFO L854 garLoopResultBuilder]: At program point L154-4(lines 142 156) the Hoare annotation is: (let ((.cse15 (= ~t1_st~0 0))) (let ((.cse10 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse11 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse12 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse13 (= ~m_pc~0 0)) (.cse16 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (not (= ~E_M~0 0))) (.cse14 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse8 (not .cse15)) (.cse9 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 (< ~local~0 ~token~0) .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse4 .cse14 .cse5 .cse6 .cse13 .cse7 .cse9) (and .cse1 .cse2 .cse10 .cse11 .cse3 (not .cse0) .cse12 .cse15 .cse4 .cse5 .cse6 .cse13 .cse7 .cse16 .cse9) (and .cse1 .cse2 .cse3 .cse15 .cse4 .cse14 .cse5 .cse6 .cse7 .cse16 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2021-11-23 13:37:54,548 INFO L858 garLoopResultBuilder]: For program point L319-11(lines 319 323) no Hoare annotation was computed. [2021-11-23 13:37:54,548 INFO L858 garLoopResultBuilder]: For program point L319-12(lines 319 323) no Hoare annotation was computed. [2021-11-23 13:37:54,548 INFO L858 garLoopResultBuilder]: For program point L319-14(lines 319 323) no Hoare annotation was computed. [2021-11-23 13:37:54,548 INFO L854 garLoopResultBuilder]: At program point L353(lines 347 355) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,549 INFO L858 garLoopResultBuilder]: For program point L287(lines 287 291) no Hoare annotation was computed. [2021-11-23 13:37:54,549 INFO L858 garLoopResultBuilder]: For program point L287-2(lines 286 309) no Hoare annotation was computed. [2021-11-23 13:37:54,549 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 198) no Hoare annotation was computed. [2021-11-23 13:37:54,549 INFO L858 garLoopResultBuilder]: For program point L287-3(lines 287 291) no Hoare annotation was computed. [2021-11-23 13:37:54,549 INFO L854 garLoopResultBuilder]: At program point L155(lines 139 157) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse9 (= ~m_pc~0 0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse9 .cse10 .cse11 .cse12))) [2021-11-23 13:37:54,550 INFO L858 garLoopResultBuilder]: For program point L188-1(lines 188 198) no Hoare annotation was computed. [2021-11-23 13:37:54,550 INFO L854 garLoopResultBuilder]: At program point L155-1(lines 139 157) the Hoare annotation is: (let ((.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~T1_E~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse7 (= ~t1_st~0 0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 0))) (.cse8 (= ~token~0 ~local~0)) (.cse9 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9) (and .cse1 .cse2 .cse3 (not .cse0) .cse7 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0) .cse4 .cse5 .cse6 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0) .cse8 .cse9))) [2021-11-23 13:37:54,550 INFO L858 garLoopResultBuilder]: For program point L287-5(lines 286 309) no Hoare annotation was computed. [2021-11-23 13:37:54,550 INFO L858 garLoopResultBuilder]: For program point L188-2(lines 188 198) no Hoare annotation was computed. [2021-11-23 13:37:54,551 INFO L854 garLoopResultBuilder]: At program point L155-2(lines 139 157) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse10 (not (= ~t1_st~0 0))) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse5 (not (= ~E_M~0 0))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (< ~local~0 ~token~0)) (and .cse1 .cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse3 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= ~m_pc~0 0) .cse9))) [2021-11-23 13:37:54,551 INFO L858 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2021-11-23 13:37:54,551 INFO L854 garLoopResultBuilder]: At program point L155-3(lines 139 157) the Hoare annotation is: (let ((.cse12 (= ~t1_st~0 0))) (let ((.cse10 (not .cse12)) (.cse6 (not (= ~m_st~0 0))) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse14 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse3 (not (= ~T1_E~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse16 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse4 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse5 (not (= ~E_M~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse13 (= ~token~0 ~local~0)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (< ~local~0 ~token~0) .cse11) (and .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse5 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11) (and .cse1 .cse2 .cse14 .cse15 .cse3 (not .cse0) .cse16 .cse12 .cse4 .cse5 .cse7 .cse8 .cse17 .cse9 .cse13 .cse11)))) [2021-11-23 13:37:54,552 INFO L854 garLoopResultBuilder]: At program point L155-4(lines 139 157) the Hoare annotation is: (let ((.cse12 (= ~t1_st~0 0))) (let ((.cse10 (not .cse12)) (.cse6 (not (= ~m_st~0 0))) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse14 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse3 (not (= ~T1_E~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse16 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse4 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse5 (not (= ~E_M~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse13 (= ~token~0 ~local~0)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (< ~local~0 ~token~0) .cse11) (and .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse5 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11) (and .cse1 .cse2 .cse14 .cse15 .cse3 (not .cse0) .cse16 .cse12 .cse4 .cse5 .cse7 .cse8 .cse17 .cse9 .cse13 .cse11)))) [2021-11-23 13:37:54,552 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-23 13:37:54,552 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 230) no Hoare annotation was computed. [2021-11-23 13:37:54,552 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 133) no Hoare annotation was computed. [2021-11-23 13:37:54,552 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-11-23 13:37:54,553 INFO L858 garLoopResultBuilder]: For program point L124-2(lines 124 133) no Hoare annotation was computed. [2021-11-23 13:37:54,553 INFO L858 garLoopResultBuilder]: For program point L124-3(lines 124 133) no Hoare annotation was computed. [2021-11-23 13:37:54,553 INFO L858 garLoopResultBuilder]: For program point L124-5(lines 124 133) no Hoare annotation was computed. [2021-11-23 13:37:54,553 INFO L858 garLoopResultBuilder]: For program point L124-6(lines 124 133) no Hoare annotation was computed. [2021-11-23 13:37:54,553 INFO L858 garLoopResultBuilder]: For program point L124-8(lines 124 133) no Hoare annotation was computed. [2021-11-23 13:37:54,554 INFO L858 garLoopResultBuilder]: For program point L124-9(lines 124 133) no Hoare annotation was computed. [2021-11-23 13:37:54,554 INFO L858 garLoopResultBuilder]: For program point L124-11(lines 124 133) no Hoare annotation was computed. [2021-11-23 13:37:54,554 INFO L858 garLoopResultBuilder]: For program point L124-12(lines 124 133) no Hoare annotation was computed. [2021-11-23 13:37:54,554 INFO L858 garLoopResultBuilder]: For program point L124-14(lines 124 133) no Hoare annotation was computed. [2021-11-23 13:37:54,554 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 130) no Hoare annotation was computed. [2021-11-23 13:37:54,555 INFO L858 garLoopResultBuilder]: For program point L125-1(lines 125 130) no Hoare annotation was computed. [2021-11-23 13:37:54,555 INFO L854 garLoopResultBuilder]: At program point L92(lines 87 118) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse2 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0) .cse7))) [2021-11-23 13:37:54,555 INFO L858 garLoopResultBuilder]: For program point L125-2(lines 125 130) no Hoare annotation was computed. [2021-11-23 13:37:54,555 INFO L858 garLoopResultBuilder]: For program point L125-3(lines 125 130) no Hoare annotation was computed. [2021-11-23 13:37:54,555 INFO L858 garLoopResultBuilder]: For program point L125-4(lines 125 130) no Hoare annotation was computed. [2021-11-23 13:37:54,556 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 197) no Hoare annotation was computed. [2021-11-23 13:37:54,556 INFO L858 garLoopResultBuilder]: For program point L192-1(lines 192 197) no Hoare annotation was computed. [2021-11-23 13:37:54,556 INFO L858 garLoopResultBuilder]: For program point L192-2(lines 192 197) no Hoare annotation was computed. [2021-11-23 13:37:54,556 INFO L854 garLoopResultBuilder]: At program point L391(lines 384 393) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-11-23 13:37:54,556 INFO L858 garLoopResultBuilder]: For program point L259(lines 259 263) no Hoare annotation was computed. [2021-11-23 13:37:54,557 INFO L858 garLoopResultBuilder]: For program point L292-1(lines 286 309) no Hoare annotation was computed. [2021-11-23 13:37:54,557 INFO L858 garLoopResultBuilder]: For program point L259-2(lines 258 281) no Hoare annotation was computed. [2021-11-23 13:37:54,557 INFO L858 garLoopResultBuilder]: For program point L292-3(lines 286 309) no Hoare annotation was computed. [2021-11-23 13:37:54,557 INFO L858 garLoopResultBuilder]: For program point L259-3(lines 259 263) no Hoare annotation was computed. [2021-11-23 13:37:54,557 INFO L858 garLoopResultBuilder]: For program point L259-5(lines 258 281) no Hoare annotation was computed. [2021-11-23 13:37:54,558 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-23 13:37:54,558 INFO L858 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2021-11-23 13:37:54,558 INFO L858 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2021-11-23 13:37:54,558 INFO L858 garLoopResultBuilder]: For program point L360-2(lines 359 382) no Hoare annotation was computed. [2021-11-23 13:37:54,558 INFO L854 garLoopResultBuilder]: At program point L327-2(lines 311 335) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse5 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse9 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse13 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~m_st~0 0)) .cse10 .cse11 .cse12 .cse13))) [2021-11-23 13:37:54,559 INFO L858 garLoopResultBuilder]: For program point L327-3(lines 327 331) no Hoare annotation was computed. [2021-11-23 13:37:54,559 INFO L854 garLoopResultBuilder]: At program point L327-5(lines 311 335) the Hoare annotation is: (let ((.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (not (= ~E_M~0 0))) (.cse4 (not (= ~m_st~0 0))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~token~0 ~local~0)) (.cse7 (not (= ~E_M~0 1)))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 (= ~t1_st~0 0) (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0) (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0) .cse3 .cse4 .cse5 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0) .cse6 .cse7))) [2021-11-23 13:37:54,559 INFO L858 garLoopResultBuilder]: For program point L327-6(lines 327 331) no Hoare annotation was computed. [2021-11-23 13:37:54,559 INFO L854 garLoopResultBuilder]: At program point L327-8(lines 311 335) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse8 (not (= ~t1_st~0 0))) (.cse1 (not (= ~T1_E~0 0))) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (not (= ~E_M~0 0))) (.cse5 (not (= ~m_st~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse7 .cse8 (< ~local~0 ~token~0)) (and .cse1 .cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0) (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0) .cse3 (= |ULTIMATE.start_is_master_triggered_#res#1| 0) .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 0)))) [2021-11-23 13:37:54,560 INFO L858 garLoopResultBuilder]: For program point L327-9(lines 327 331) no Hoare annotation was computed. [2021-11-23 13:37:54,560 INFO L854 garLoopResultBuilder]: At program point L327-11(lines 311 335) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,560 INFO L858 garLoopResultBuilder]: For program point L327-12(lines 327 331) no Hoare annotation was computed. [2021-11-23 13:37:54,561 INFO L854 garLoopResultBuilder]: At program point L327-14(lines 311 335) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,561 INFO L858 garLoopResultBuilder]: For program point L460(lines 460 464) no Hoare annotation was computed. [2021-11-23 13:37:54,561 INFO L854 garLoopResultBuilder]: At program point L163(lines 158 165) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~t1_st~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-11-23 13:37:54,561 INFO L854 garLoopResultBuilder]: At program point L163-1(lines 158 165) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,562 INFO L854 garLoopResultBuilder]: At program point L428-2(lines 428 465) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,562 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-23 13:37:54,562 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-11-23 13:37:54,563 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2021-11-23 13:37:54,563 INFO L858 garLoopResultBuilder]: For program point L297-1(lines 286 309) no Hoare annotation was computed. [2021-11-23 13:37:54,563 INFO L858 garLoopResultBuilder]: For program point L264-1(lines 258 281) no Hoare annotation was computed. [2021-11-23 13:37:54,563 INFO L858 garLoopResultBuilder]: For program point L297-3(lines 286 309) no Hoare annotation was computed. [2021-11-23 13:37:54,563 INFO L858 garLoopResultBuilder]: For program point L264-3(lines 258 281) no Hoare annotation was computed. [2021-11-23 13:37:54,564 INFO L854 garLoopResultBuilder]: At program point L99-1(lines 87 118) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse7 (not (= ~m_st~0 0))) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse12 (not (= ~t1_st~0 0))) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse11) (and .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse12 .cse11) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse12 (< ~local~0 ~token~0) .cse11))) [2021-11-23 13:37:54,564 INFO L858 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2021-11-23 13:37:54,564 INFO L858 garLoopResultBuilder]: For program point L365-1(lines 359 382) no Hoare annotation was computed. [2021-11-23 13:37:54,564 INFO L854 garLoopResultBuilder]: At program point L200(lines 187 202) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,565 INFO L854 garLoopResultBuilder]: At program point L200-1(lines 187 202) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,565 INFO L854 garLoopResultBuilder]: At program point L200-2(lines 187 202) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0))) (let ((.cse2 (= |ULTIMATE.start_is_master_triggered_~__retres1~0#1| 0)) (.cse3 (= |ULTIMATE.start_activate_threads_~tmp~1#1| 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res#1| 0)) (.cse10 (= ~m_pc~0 0)) (.cse15 (= |ULTIMATE.start_activate_threads_~tmp___0~0#1| 0)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res#1| 0)) (.cse7 (not (= ~m_st~0 0))) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse18 (= ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (not (= ~T1_E~0 0))) (.cse1 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_M~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse13 (not .cse14)) (.cse11 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse12) .cse5 .cse14 .cse15 .cse16 .cse6 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11) (and .cse0 .cse1 .cse4 .cse14 .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11) (and .cse12 .cse0 .cse1 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse13 (< ~local~0 ~token~0) .cse11)))) [2021-11-23 13:37:54,570 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:37:54,572 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 13:37:54,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:37:54 BoogieIcfgContainer [2021-11-23 13:37:54,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 13:37:54,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 13:37:54,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 13:37:54,702 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 13:37:54,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:37:16" (3/4) ... [2021-11-23 13:37:54,706 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 13:37:54,742 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-11-23 13:37:54,744 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-23 13:37:54,745 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-23 13:37:54,746 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-23 13:37:54,782 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && \result == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2) || ((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && \result == 0) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == M_E) && M_E == 2) [2021-11-23 13:37:54,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && token == local) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && M_E == 2) [2021-11-23 13:37:54,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && \result == 0) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && token == local) && M_E == 2) || (((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && M_E == 2) [2021-11-23 13:37:54,784 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && token == local) && M_E == 2) || ((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && M_E == 2) [2021-11-23 13:37:54,785 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((T1_E == M_E && !(T1_E == 0)) && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && token == local) && M_E == 2) || ((((((((((((((((T1_E == M_E && !(T1_E == 0)) && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && M_E == 2) [2021-11-23 13:37:54,785 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,785 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,786 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,786 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,786 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,788 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,788 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,790 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || (((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,790 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local + 1) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1)) [2021-11-23 13:37:54,791 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && !(t1_pc == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,791 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || (((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,791 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1)) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,791 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,792 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,792 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1)) [2021-11-23 13:37:54,793 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || (((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(E_M == 1))) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,797 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || (((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) [2021-11-23 13:37:54,797 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,798 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && !(t1_st == 0)) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,798 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,801 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,802 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token)) || (((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) [2021-11-23 13:37:54,803 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token)) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) [2021-11-23 13:37:54,803 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,803 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && !(t1_pc == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,803 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,804 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) [2021-11-23 13:37:54,804 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) [2021-11-23 13:37:54,804 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && token == local) && !(E_M == 1)) || (((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,804 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && token == local) && !(E_M == 1)) || (((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,808 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,808 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,808 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || (((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,808 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local + 1) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1)) [2021-11-23 13:37:54,809 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,809 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,809 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1)) [2021-11-23 13:37:54,809 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || (((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(E_M == 1))) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1)) [2021-11-23 13:37:54,810 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,810 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) [2021-11-23 13:37:54,899 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/witness.graphml [2021-11-23 13:37:54,899 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 13:37:54,900 INFO L158 Benchmark]: Toolchain (without parser) took 39580.51ms. Allocated memory was 86.0MB in the beginning and 444.6MB in the end (delta: 358.6MB). Free memory was 46.1MB in the beginning and 247.1MB in the end (delta: -201.0MB). Peak memory consumption was 158.6MB. Max. memory is 16.1GB. [2021-11-23 13:37:54,901 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 86.0MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 13:37:54,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.59ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 45.9MB in the beginning and 75.4MB in the end (delta: -29.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-23 13:37:54,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.17ms. Allocated memory is still 104.9MB. Free memory was 75.4MB in the beginning and 73.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:37:54,902 INFO L158 Benchmark]: Boogie Preprocessor took 71.13ms. Allocated memory is still 104.9MB. Free memory was 73.0MB in the beginning and 70.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 13:37:54,903 INFO L158 Benchmark]: RCFGBuilder took 738.55ms. Allocated memory is still 104.9MB. Free memory was 70.9MB in the beginning and 51.3MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-23 13:37:54,908 INFO L158 Benchmark]: TraceAbstraction took 37987.19ms. Allocated memory was 104.9MB in the beginning and 444.6MB in the end (delta: 339.7MB). Free memory was 50.9MB in the beginning and 257.6MB in the end (delta: -206.7MB). Peak memory consumption was 245.4MB. Max. memory is 16.1GB. [2021-11-23 13:37:54,909 INFO L158 Benchmark]: Witness Printer took 198.28ms. Allocated memory is still 444.6MB. Free memory was 257.6MB in the beginning and 247.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 13:37:54,915 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.40ms. Allocated memory is still 86.0MB. Free memory was 62.3MB in the beginning and 62.3MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.59ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 45.9MB in the beginning and 75.4MB in the end (delta: -29.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.17ms. Allocated memory is still 104.9MB. Free memory was 75.4MB in the beginning and 73.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.13ms. Allocated memory is still 104.9MB. Free memory was 73.0MB in the beginning and 70.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 738.55ms. Allocated memory is still 104.9MB. Free memory was 70.9MB in the beginning and 51.3MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 37987.19ms. Allocated memory was 104.9MB in the beginning and 444.6MB in the end (delta: 339.7MB). Free memory was 50.9MB in the beginning and 257.6MB in the end (delta: -206.7MB). Peak memory consumption was 245.4MB. Max. memory is 16.1GB. * Witness Printer took 198.28ms. Allocated memory is still 444.6MB. Free memory was 257.6MB in the beginning and 247.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * 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: 20]: 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, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.8s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 29.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5714 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5714 mSDsluCounter, 8529 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4419 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 4110 mSDtfsCounter, 543 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1862occurred in iteration=16, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 3085 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 57 LocationsWithAnnotation, 57 PreInvPairs, 687 NumberOfFragments, 10723 HoareAnnotationTreeSize, 57 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 9.5s HoareSimplificationTime, 57 FomulaSimplificationsInter, 1450671 FormulaSimplificationTreeSizeReductionInter, 20.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 1285 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1267 ConstructedInterpolants, 0 QuantifiedInterpolants, 2143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 297/297 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: 142]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1)) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && token == local) && !(E_M == 1)) || (((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && t1_st == 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2) - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local + 1) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && !(t1_st == 0)) && token == local) && !(E_M == 1)) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || (((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(E_M == 1))) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || (((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: ((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && \result == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2) || ((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && \result == 0) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1) - InvariantResult [Line: 384]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && m_st == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2 - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local + 1) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && !(T1_E == 0)) && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_1 == 0)) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && token == local) && M_E == 2) || ((((((((((((((((T1_E == M_E && !(T1_E == 0)) && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(m_st == 0)) && !(E_1 == 0)) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && M_E == 2) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && token == local) && M_E == 2) || ((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && M_E == 2) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || (((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(E_M == 1))) || (((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token)) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && token == local) && !(E_M == 1)) || (((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || (((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && token == local) && M_E == 2) || ((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && M_E == 2) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2) || (((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token)) || ((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && token == local) && !(E_M == 1)) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || (((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 428]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && \result == 0) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && token == local) && M_E == 2) || (((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && __retres1 == 0) && tmp == 0) && \result == 0) && t1_st == 0) && \result == 0) && !(m_st == 0)) && m_pc == 0) && E_M == M_E) && __retres1 == 0) && M_E == 2) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && !(t1_pc == 1)) && t1_st == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && !(t1_st == 0)) && token == local) && !(E_M == 1)) - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && m_st == 0) && t1_st == 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2 - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == M_E) && M_E == 2) || ((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && m_pc == t1_pc) && t1_st == 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && !(t1_st == 0)) && token == local) && !(E_M == 1)) || (((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && !(t1_pc == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token) && !(E_M == 1)) || (((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && !(E_M == 1))) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && !(E_M == 1)) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1)) || ((((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && !(t1_pc == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1)) || (((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || (((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1))) || (((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && !(T1_E == 1)) && t1_st == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(t1_st == 0)) && local < token)) || (((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(E_M == 1)) || ((((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && !(t1_st == 0)) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && !(E_M == 1))) || ((((((((((((((((!(T1_E == 0) && t1_i == 1) && __retres1 == 0) && tmp == 0) && !(T1_E == 1)) && !(t1_pc == 1)) && \result == 0) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && m_pc == 0) && __retres1 == 0) && token == local) && !(E_M == 1))) || (((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && token == local) && !(E_M == 1))) || ((((((((((((!(T1_E == 0) && t1_i == 1) && !(T1_E == 1)) && t1_st == 0) && tmp___0 == 0) && \result == 0) && !(E_M == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && __retres1 == 0) && token == local) && !(E_M == 1))) || ((((((((((t1_pc == 1 && !(T1_E == 0)) && t1_i == 1) && !(T1_E == 1)) && token <= local + 1) && !(E_M == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(t1_st == 0)) && local < token) && !(E_M == 1)) RESULT: Ultimate proved your program to be correct! [2021-11-23 13:37:55,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fa3932a-9cbe-4e2d-80b6-c36fa19f5555/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE