./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a08b839794d511e255b2cbb9b4715d014c32f56d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.multireach-323-8d31f38 [2021-07-05 10:17:44,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-05 10:17:44,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-05 10:17:44,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-05 10:17:44,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-05 10:17:44,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-05 10:17:44,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-05 10:17:44,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-05 10:17:44,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-05 10:17:44,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-05 10:17:44,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-05 10:17:44,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-05 10:17:44,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-05 10:17:44,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-05 10:17:44,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-05 10:17:44,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-05 10:17:44,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-05 10:17:44,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-05 10:17:44,184 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-05 10:17:44,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-05 10:17:44,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-05 10:17:44,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-05 10:17:44,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-05 10:17:44,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-05 10:17:44,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-05 10:17:44,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-05 10:17:44,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-05 10:17:44,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-05 10:17:44,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-05 10:17:44,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-05 10:17:44,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-05 10:17:44,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-05 10:17:44,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-05 10:17:44,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-05 10:17:44,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-05 10:17:44,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-05 10:17:44,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-05 10:17:44,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-05 10:17:44,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-05 10:17:44,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-05 10:17:44,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-05 10:17:44,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-07-05 10:17:44,232 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-05 10:17:44,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-05 10:17:44,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-05 10:17:44,234 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-05 10:17:44,234 INFO L138 SettingsManager]: * Use SBE=true [2021-07-05 10:17:44,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-05 10:17:44,235 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-05 10:17:44,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-05 10:17:44,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-05 10:17:44,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-05 10:17:44,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-05 10:17:44,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-05 10:17:44,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-05 10:17:44,236 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-05 10:17:44,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-05 10:17:44,237 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-05 10:17:44,237 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-05 10:17:44,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-05 10:17:44,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-05 10:17:44,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-05 10:17:44,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 10:17:44,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-05 10:17:44,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-05 10:17:44,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-05 10:17:44,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-05 10:17:44,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-05 10:17:44,238 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-05 10:17:44,239 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-05 10:17:44,239 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a08b839794d511e255b2cbb9b4715d014c32f56d [2021-07-05 10:17:44,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-05 10:17:44,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-05 10:17:44,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-05 10:17:44,498 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-05 10:17:44,498 INFO L275 PluginConnector]: CDTParser initialized [2021-07-05 10:17:44,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2021-07-05 10:17:44,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d22b484/60cb39d9f47e4552b25a2451ae84ae01/FLAG76d95cd41 [2021-07-05 10:17:44,932 INFO L306 CDTParser]: Found 1 translation units. [2021-07-05 10:17:44,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2021-07-05 10:17:44,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d22b484/60cb39d9f47e4552b25a2451ae84ae01/FLAG76d95cd41 [2021-07-05 10:17:44,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d22b484/60cb39d9f47e4552b25a2451ae84ae01 [2021-07-05 10:17:44,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-05 10:17:44,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-05 10:17:44,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-05 10:17:44,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-05 10:17:44,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-05 10:17:44,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 10:17:44" (1/1) ... [2021-07-05 10:17:44,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447ef11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:44, skipping insertion in model container [2021-07-05 10:17:44,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 10:17:44" (1/1) ... [2021-07-05 10:17:44,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-05 10:17:45,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-05 10:17:45,106 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[366,379] [2021-07-05 10:17:45,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 10:17:45,191 INFO L203 MainTranslator]: Completed pre-run [2021-07-05 10:17:45,200 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[366,379] [2021-07-05 10:17:45,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 10:17:45,248 INFO L208 MainTranslator]: Completed translation [2021-07-05 10:17:45,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45 WrapperNode [2021-07-05 10:17:45,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-05 10:17:45,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-05 10:17:45,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-05 10:17:45,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-05 10:17:45,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45" (1/1) ... [2021-07-05 10:17:45,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45" (1/1) ... [2021-07-05 10:17:45,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-05 10:17:45,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-05 10:17:45,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-05 10:17:45,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-05 10:17:45,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45" (1/1) ... [2021-07-05 10:17:45,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45" (1/1) ... [2021-07-05 10:17:45,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45" (1/1) ... [2021-07-05 10:17:45,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45" (1/1) ... [2021-07-05 10:17:45,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45" (1/1) ... [2021-07-05 10:17:45,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45" (1/1) ... [2021-07-05 10:17:45,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45" (1/1) ... [2021-07-05 10:17:45,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-05 10:17:45,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-05 10:17:45,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-05 10:17:45,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-05 10:17:45,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45" (1/1) ... [2021-07-05 10:17:45,370 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 10:17:45,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-05 10:17:45,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-07-05 10:17:45,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-07-05 10:17:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-05 10:17:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-05 10:17:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-05 10:17:45,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-05 10:17:46,054 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-05 10:17:46,055 INFO L299 CfgBuilder]: Removed 105 assume(true) statements. [2021-07-05 10:17:46,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 10:17:46 BoogieIcfgContainer [2021-07-05 10:17:46,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-05 10:17:46,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-05 10:17:46,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-05 10:17:46,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-05 10:17:46,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.07 10:17:44" (1/3) ... [2021-07-05 10:17:46,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8bc9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 10:17:46, skipping insertion in model container [2021-07-05 10:17:46,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:17:45" (2/3) ... [2021-07-05 10:17:46,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8bc9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 10:17:46, skipping insertion in model container [2021-07-05 10:17:46,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 10:17:46" (3/3) ... [2021-07-05 10:17:46,072 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2021-07-05 10:17:46,077 INFO L198 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-05 10:17:46,077 INFO L158 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-05 10:17:46,105 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 10:17:46,109 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 10:17:46,109 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 10:17:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 222 states have (on average 1.5855855855855856) internal successors, (352), 224 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-07-05 10:17:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 10:17:46,127 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:46,127 INFO L525 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, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:46,127 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2021-07-05 10:17:46,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:46,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618204580] [2021-07-05 10:17:46,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:46,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:46,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:46,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:46,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:46,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:46,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618204580] [2021-07-05 10:17:46,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618204580] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:46,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:46,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:46,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168365071] [2021-07-05 10:17:46,257 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:46,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:46,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:46,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:46,267 INFO L87 Difference]: Start difference. First operand has 225 states, 222 states have (on average 1.5855855855855856) internal successors, (352), 224 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) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:46,309 INFO L93 Difference]: Finished difference Result 445 states and 697 transitions. [2021-07-05 10:17:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:46,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2021-07-05 10:17:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:46,317 INFO L225 Difference]: With dead ends: 445 [2021-07-05 10:17:46,317 INFO L226 Difference]: Without dead ends: 219 [2021-07-05 10:17:46,319 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:46,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-07-05 10:17:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2021-07-05 10:17:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.5275229357798166) internal successors, (333), 218 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 333 transitions. [2021-07-05 10:17:46,351 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 333 transitions. Word has length 50 [2021-07-05 10:17:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:46,351 INFO L442 AbstractCegarLoop]: Abstraction has 219 states and 333 transitions. [2021-07-05 10:17:46,352 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 333 transitions. [2021-07-05 10:17:46,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 10:17:46,353 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:46,353 INFO L525 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, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:46,354 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-05 10:17:46,354 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:46,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:46,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2021-07-05 10:17:46,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:46,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989068748] [2021-07-05 10:17:46,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:46,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:46,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:46,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:46,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:46,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989068748] [2021-07-05 10:17:46,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989068748] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:46,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:46,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 10:17:46,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730153316] [2021-07-05 10:17:46,402 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:46,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:46,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:46,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:46,404 INFO L87 Difference]: Start difference. First operand 219 states and 333 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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-07-05 10:17:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:46,440 INFO L93 Difference]: Finished difference Result 589 states and 895 transitions. [2021-07-05 10:17:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:46,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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 50 [2021-07-05 10:17:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:46,442 INFO L225 Difference]: With dead ends: 589 [2021-07-05 10:17:46,442 INFO L226 Difference]: Without dead ends: 377 [2021-07-05 10:17:46,443 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-07-05 10:17:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2021-07-05 10:17:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.5160427807486632) internal successors, (567), 374 states have internal predecessors, (567), 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-07-05 10:17:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 567 transitions. [2021-07-05 10:17:46,464 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 567 transitions. Word has length 50 [2021-07-05 10:17:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:46,465 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 567 transitions. [2021-07-05 10:17:46,465 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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-07-05 10:17:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 567 transitions. [2021-07-05 10:17:46,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 10:17:46,466 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:46,466 INFO L525 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, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:46,466 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-05 10:17:46,466 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:46,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:46,467 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2021-07-05 10:17:46,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:46,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565024517] [2021-07-05 10:17:46,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:46,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:46,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:46,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:46,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:46,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:46,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565024517] [2021-07-05 10:17:46,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565024517] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:46,505 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:46,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:46,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199174174] [2021-07-05 10:17:46,506 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:46,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:46,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:46,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:46,507 INFO L87 Difference]: Start difference. First operand 375 states and 567 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:46,553 INFO L93 Difference]: Finished difference Result 899 states and 1358 transitions. [2021-07-05 10:17:46,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:46,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2021-07-05 10:17:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:46,556 INFO L225 Difference]: With dead ends: 899 [2021-07-05 10:17:46,556 INFO L226 Difference]: Without dead ends: 532 [2021-07-05 10:17:46,557 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-07-05 10:17:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 375. [2021-07-05 10:17:46,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.5080213903743316) internal successors, (564), 374 states have internal predecessors, (564), 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-07-05 10:17:46,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 564 transitions. [2021-07-05 10:17:46,573 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 564 transitions. Word has length 50 [2021-07-05 10:17:46,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:46,573 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 564 transitions. [2021-07-05 10:17:46,573 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,573 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 564 transitions. [2021-07-05 10:17:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 10:17:46,574 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:46,575 INFO L525 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, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:46,575 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-05 10:17:46,575 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash -794624073, now seen corresponding path program 1 times [2021-07-05 10:17:46,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:46,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521349477] [2021-07-05 10:17:46,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:46,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:46,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:46,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:46,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:46,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:46,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521349477] [2021-07-05 10:17:46,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521349477] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:46,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:46,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:46,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500722123] [2021-07-05 10:17:46,604 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:46,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:46,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:46,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:46,605 INFO L87 Difference]: Start difference. First operand 375 states and 564 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:46,651 INFO L93 Difference]: Finished difference Result 897 states and 1348 transitions. [2021-07-05 10:17:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:46,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2021-07-05 10:17:46,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:46,654 INFO L225 Difference]: With dead ends: 897 [2021-07-05 10:17:46,654 INFO L226 Difference]: Without dead ends: 531 [2021-07-05 10:17:46,655 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-07-05 10:17:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 375. [2021-07-05 10:17:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.5) internal successors, (561), 374 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 561 transitions. [2021-07-05 10:17:46,667 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 561 transitions. Word has length 50 [2021-07-05 10:17:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:46,668 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 561 transitions. [2021-07-05 10:17:46,668 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 561 transitions. [2021-07-05 10:17:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 10:17:46,669 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:46,669 INFO L525 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, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:46,669 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-05 10:17:46,669 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash -546477579, now seen corresponding path program 1 times [2021-07-05 10:17:46,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:46,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910198935] [2021-07-05 10:17:46,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:46,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:46,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:46,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:46,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:46,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:46,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910198935] [2021-07-05 10:17:46,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910198935] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:46,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:46,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:46,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029454459] [2021-07-05 10:17:46,696 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:46,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:46,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:46,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:46,697 INFO L87 Difference]: Start difference. First operand 375 states and 561 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:46,767 INFO L93 Difference]: Finished difference Result 874 states and 1308 transitions. [2021-07-05 10:17:46,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:46,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2021-07-05 10:17:46,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:46,769 INFO L225 Difference]: With dead ends: 874 [2021-07-05 10:17:46,769 INFO L226 Difference]: Without dead ends: 509 [2021-07-05 10:17:46,770 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-07-05 10:17:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 375. [2021-07-05 10:17:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.4919786096256684) internal successors, (558), 374 states have internal predecessors, (558), 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-07-05 10:17:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 558 transitions. [2021-07-05 10:17:46,783 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 558 transitions. Word has length 50 [2021-07-05 10:17:46,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:46,783 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 558 transitions. [2021-07-05 10:17:46,783 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 558 transitions. [2021-07-05 10:17:46,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 10:17:46,784 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:46,784 INFO L525 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, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:46,784 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-05 10:17:46,785 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:46,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:46,785 INFO L82 PathProgramCache]: Analyzing trace with hash -122830857, now seen corresponding path program 1 times [2021-07-05 10:17:46,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:46,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61373597] [2021-07-05 10:17:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:46,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:46,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:46,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:46,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:46,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:46,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61373597] [2021-07-05 10:17:46,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61373597] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:46,809 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:46,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:46,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682067454] [2021-07-05 10:17:46,810 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:46,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:46,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:46,811 INFO L87 Difference]: Start difference. First operand 375 states and 558 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:46,874 INFO L93 Difference]: Finished difference Result 872 states and 1298 transitions. [2021-07-05 10:17:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:46,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2021-07-05 10:17:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:46,876 INFO L225 Difference]: With dead ends: 872 [2021-07-05 10:17:46,876 INFO L226 Difference]: Without dead ends: 508 [2021-07-05 10:17:46,876 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-07-05 10:17:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 375. [2021-07-05 10:17:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.4839572192513368) internal successors, (555), 374 states have internal predecessors, (555), 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-07-05 10:17:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 555 transitions. [2021-07-05 10:17:46,888 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 555 transitions. Word has length 50 [2021-07-05 10:17:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:46,889 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 555 transitions. [2021-07-05 10:17:46,889 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 555 transitions. [2021-07-05 10:17:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 10:17:46,889 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:46,889 INFO L525 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, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:46,890 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-05 10:17:46,890 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:46,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:46,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1494638155, now seen corresponding path program 1 times [2021-07-05 10:17:46,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:46,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430431818] [2021-07-05 10:17:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:46,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:46,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:46,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:46,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:46,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:46,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:46,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430431818] [2021-07-05 10:17:46,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430431818] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:46,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:46,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:46,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763516629] [2021-07-05 10:17:46,913 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:46,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:46,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:46,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:46,914 INFO L87 Difference]: Start difference. First operand 375 states and 555 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:46,976 INFO L93 Difference]: Finished difference Result 870 states and 1288 transitions. [2021-07-05 10:17:46,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:46,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2021-07-05 10:17:46,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:46,983 INFO L225 Difference]: With dead ends: 870 [2021-07-05 10:17:46,983 INFO L226 Difference]: Without dead ends: 507 [2021-07-05 10:17:46,984 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-07-05 10:17:46,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 375. [2021-07-05 10:17:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.4759358288770053) internal successors, (552), 374 states have internal predecessors, (552), 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-07-05 10:17:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 552 transitions. [2021-07-05 10:17:46,997 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 552 transitions. Word has length 50 [2021-07-05 10:17:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:46,997 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 552 transitions. [2021-07-05 10:17:46,997 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 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-07-05 10:17:46,997 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 552 transitions. [2021-07-05 10:17:46,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-07-05 10:17:46,998 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:46,998 INFO L525 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, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:46,998 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-05 10:17:46,998 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:46,999 INFO L82 PathProgramCache]: Analyzing trace with hash 954961975, now seen corresponding path program 1 times [2021-07-05 10:17:46,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:46,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730445648] [2021-07-05 10:17:46,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:46,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:47,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:47,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:47,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:47,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730445648] [2021-07-05 10:17:47,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730445648] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:47,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:47,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 10:17:47,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428241776] [2021-07-05 10:17:47,018 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:47,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:47,018 INFO L87 Difference]: Start difference. First operand 375 states and 552 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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-07-05 10:17:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:47,058 INFO L93 Difference]: Finished difference Result 1046 states and 1537 transitions. [2021-07-05 10:17:47,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:47,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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 50 [2021-07-05 10:17:47,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:47,061 INFO L225 Difference]: With dead ends: 1046 [2021-07-05 10:17:47,061 INFO L226 Difference]: Without dead ends: 685 [2021-07-05 10:17:47,062 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:47,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-07-05 10:17:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 647. [2021-07-05 10:17:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.4520123839009287) internal successors, (938), 646 states have internal predecessors, (938), 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-07-05 10:17:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 938 transitions. [2021-07-05 10:17:47,091 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 938 transitions. Word has length 50 [2021-07-05 10:17:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:47,091 INFO L442 AbstractCegarLoop]: Abstraction has 647 states and 938 transitions. [2021-07-05 10:17:47,091 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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-07-05 10:17:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 938 transitions. [2021-07-05 10:17:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-05 10:17:47,092 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:47,092 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:47,092 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-05 10:17:47,092 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:47,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:47,093 INFO L82 PathProgramCache]: Analyzing trace with hash -909557037, now seen corresponding path program 1 times [2021-07-05 10:17:47,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:47,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217415137] [2021-07-05 10:17:47,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:47,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:47,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:47,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:47,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:47,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:47,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:17:47,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:47,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217415137] [2021-07-05 10:17:47,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217415137] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:47,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:47,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:17:47,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889153488] [2021-07-05 10:17:47,127 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:17:47,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:47,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:17:47,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:47,128 INFO L87 Difference]: Start difference. First operand 647 states and 938 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-07-05 10:17:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:47,239 INFO L93 Difference]: Finished difference Result 1875 states and 2731 transitions. [2021-07-05 10:17:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:17:47,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 81 [2021-07-05 10:17:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:47,243 INFO L225 Difference]: With dead ends: 1875 [2021-07-05 10:17:47,243 INFO L226 Difference]: Without dead ends: 1246 [2021-07-05 10:17:47,244 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:17:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2021-07-05 10:17:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 674. [2021-07-05 10:17:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 1.4219910846953938) internal successors, (957), 673 states have internal predecessors, (957), 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-07-05 10:17:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 957 transitions. [2021-07-05 10:17:47,275 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 957 transitions. Word has length 81 [2021-07-05 10:17:47,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:47,275 INFO L442 AbstractCegarLoop]: Abstraction has 674 states and 957 transitions. [2021-07-05 10:17:47,275 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-07-05 10:17:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 957 transitions. [2021-07-05 10:17:47,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-05 10:17:47,276 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:47,276 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:47,276 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-05 10:17:47,277 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:47,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:47,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1473423025, now seen corresponding path program 1 times [2021-07-05 10:17:47,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:47,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303885170] [2021-07-05 10:17:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:47,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:47,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:47,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:47,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:17:47,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:47,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303885170] [2021-07-05 10:17:47,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303885170] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:47,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:47,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:47,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950686838] [2021-07-05 10:17:47,299 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:47,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:47,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:47,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:47,300 INFO L87 Difference]: Start difference. First operand 674 states and 957 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-07-05 10:17:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:47,413 INFO L93 Difference]: Finished difference Result 2169 states and 3077 transitions. [2021-07-05 10:17:47,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:47,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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 81 [2021-07-05 10:17:47,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:47,417 INFO L225 Difference]: With dead ends: 2169 [2021-07-05 10:17:47,418 INFO L226 Difference]: Without dead ends: 1515 [2021-07-05 10:17:47,418 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2021-07-05 10:17:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1195. [2021-07-05 10:17:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1194 states have (on average 1.414572864321608) internal successors, (1689), 1194 states have internal predecessors, (1689), 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-07-05 10:17:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1689 transitions. [2021-07-05 10:17:47,472 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1689 transitions. Word has length 81 [2021-07-05 10:17:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:47,472 INFO L442 AbstractCegarLoop]: Abstraction has 1195 states and 1689 transitions. [2021-07-05 10:17:47,472 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-07-05 10:17:47,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1689 transitions. [2021-07-05 10:17:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-05 10:17:47,473 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:47,473 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:47,473 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-05 10:17:47,474 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:47,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:47,474 INFO L82 PathProgramCache]: Analyzing trace with hash 346302894, now seen corresponding path program 1 times [2021-07-05 10:17:47,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:47,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478567117] [2021-07-05 10:17:47,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:47,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:47,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:47,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:47,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:47,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:47,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:17:47,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:47,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478567117] [2021-07-05 10:17:47,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478567117] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:47,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:47,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:17:47,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694936802] [2021-07-05 10:17:47,498 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:17:47,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:47,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:17:47,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:47,499 INFO L87 Difference]: Start difference. First operand 1195 states and 1689 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-07-05 10:17:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:47,651 INFO L93 Difference]: Finished difference Result 3360 states and 4778 transitions. [2021-07-05 10:17:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:17:47,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 81 [2021-07-05 10:17:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:47,658 INFO L225 Difference]: With dead ends: 3360 [2021-07-05 10:17:47,658 INFO L226 Difference]: Without dead ends: 2189 [2021-07-05 10:17:47,661 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:17:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2021-07-05 10:17:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1243. [2021-07-05 10:17:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.3880837359098228) internal successors, (1724), 1242 states have internal predecessors, (1724), 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-07-05 10:17:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1724 transitions. [2021-07-05 10:17:47,729 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1724 transitions. Word has length 81 [2021-07-05 10:17:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:47,729 INFO L442 AbstractCegarLoop]: Abstraction has 1243 states and 1724 transitions. [2021-07-05 10:17:47,729 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-07-05 10:17:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1724 transitions. [2021-07-05 10:17:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-05 10:17:47,730 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:47,730 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:47,730 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-05 10:17:47,731 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:47,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:47,731 INFO L82 PathProgramCache]: Analyzing trace with hash 998886698, now seen corresponding path program 1 times [2021-07-05 10:17:47,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:47,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265445666] [2021-07-05 10:17:47,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:47,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:47,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:47,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:47,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:47,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:17:47,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:47,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265445666] [2021-07-05 10:17:47,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265445666] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:47,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:47,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:47,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068521926] [2021-07-05 10:17:47,781 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:47,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:47,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:47,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:47,781 INFO L87 Difference]: Start difference. First operand 1243 states and 1724 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-07-05 10:17:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:47,911 INFO L93 Difference]: Finished difference Result 2989 states and 4142 transitions. [2021-07-05 10:17:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:47,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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 81 [2021-07-05 10:17:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:47,916 INFO L225 Difference]: With dead ends: 2989 [2021-07-05 10:17:47,916 INFO L226 Difference]: Without dead ends: 1779 [2021-07-05 10:17:47,919 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2021-07-05 10:17:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1243. [2021-07-05 10:17:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.3743961352657006) internal successors, (1707), 1242 states have internal predecessors, (1707), 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-07-05 10:17:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1707 transitions. [2021-07-05 10:17:47,981 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1707 transitions. Word has length 81 [2021-07-05 10:17:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:47,981 INFO L442 AbstractCegarLoop]: Abstraction has 1243 states and 1707 transitions. [2021-07-05 10:17:47,981 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-07-05 10:17:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1707 transitions. [2021-07-05 10:17:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-05 10:17:47,982 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:47,982 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:47,982 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-05 10:17:47,983 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:47,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:47,984 INFO L82 PathProgramCache]: Analyzing trace with hash 517806440, now seen corresponding path program 1 times [2021-07-05 10:17:47,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:47,984 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890978417] [2021-07-05 10:17:47,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:47,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:48,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:48,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:48,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:17:48,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:48,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890978417] [2021-07-05 10:17:48,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890978417] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:48,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:48,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:48,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13947313] [2021-07-05 10:17:48,014 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:48,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:48,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:48,015 INFO L87 Difference]: Start difference. First operand 1243 states and 1707 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-07-05 10:17:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:48,107 INFO L93 Difference]: Finished difference Result 2988 states and 4103 transitions. [2021-07-05 10:17:48,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:48,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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 81 [2021-07-05 10:17:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:48,113 INFO L225 Difference]: With dead ends: 2988 [2021-07-05 10:17:48,113 INFO L226 Difference]: Without dead ends: 1779 [2021-07-05 10:17:48,114 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2021-07-05 10:17:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1243. [2021-07-05 10:17:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.3607085346215781) internal successors, (1690), 1242 states have internal predecessors, (1690), 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-07-05 10:17:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1690 transitions. [2021-07-05 10:17:48,170 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1690 transitions. Word has length 81 [2021-07-05 10:17:48,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:48,170 INFO L442 AbstractCegarLoop]: Abstraction has 1243 states and 1690 transitions. [2021-07-05 10:17:48,170 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-07-05 10:17:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1690 transitions. [2021-07-05 10:17:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-05 10:17:48,171 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:48,171 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:48,171 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-05 10:17:48,171 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:48,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:48,172 INFO L82 PathProgramCache]: Analyzing trace with hash 502287722, now seen corresponding path program 1 times [2021-07-05 10:17:48,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:48,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64239628] [2021-07-05 10:17:48,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:48,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:48,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:48,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:48,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:17:48,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:48,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64239628] [2021-07-05 10:17:48,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64239628] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:48,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:48,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:48,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629236474] [2021-07-05 10:17:48,192 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:48,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:48,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:48,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:48,193 INFO L87 Difference]: Start difference. First operand 1243 states and 1690 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-07-05 10:17:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:48,293 INFO L93 Difference]: Finished difference Result 2924 states and 3978 transitions. [2021-07-05 10:17:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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 81 [2021-07-05 10:17:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:48,304 INFO L225 Difference]: With dead ends: 2924 [2021-07-05 10:17:48,304 INFO L226 Difference]: Without dead ends: 1716 [2021-07-05 10:17:48,306 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2021-07-05 10:17:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1207. [2021-07-05 10:17:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 1.3374792703150913) internal successors, (1613), 1206 states have internal predecessors, (1613), 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-07-05 10:17:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1613 transitions. [2021-07-05 10:17:48,370 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1613 transitions. Word has length 81 [2021-07-05 10:17:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:48,370 INFO L442 AbstractCegarLoop]: Abstraction has 1207 states and 1613 transitions. [2021-07-05 10:17:48,370 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-07-05 10:17:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1613 transitions. [2021-07-05 10:17:48,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-05 10:17:48,371 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:48,371 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:48,372 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-05 10:17:48,372 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:48,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:48,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1853517528, now seen corresponding path program 1 times [2021-07-05 10:17:48,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:48,372 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249231324] [2021-07-05 10:17:48,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:48,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:48,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:48,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:48,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:17:48,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:48,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249231324] [2021-07-05 10:17:48,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249231324] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:48,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:48,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:48,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125806924] [2021-07-05 10:17:48,392 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:48,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:48,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:48,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:48,393 INFO L87 Difference]: Start difference. First operand 1207 states and 1613 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-07-05 10:17:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:48,510 INFO L93 Difference]: Finished difference Result 2880 states and 3854 transitions. [2021-07-05 10:17:48,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:48,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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 81 [2021-07-05 10:17:48,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:48,515 INFO L225 Difference]: With dead ends: 2880 [2021-07-05 10:17:48,515 INFO L226 Difference]: Without dead ends: 1701 [2021-07-05 10:17:48,517 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2021-07-05 10:17:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1207. [2021-07-05 10:17:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 1.302653399668325) internal successors, (1571), 1206 states have internal predecessors, (1571), 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-07-05 10:17:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1571 transitions. [2021-07-05 10:17:48,569 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1571 transitions. Word has length 81 [2021-07-05 10:17:48,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:48,569 INFO L442 AbstractCegarLoop]: Abstraction has 1207 states and 1571 transitions. [2021-07-05 10:17:48,569 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 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-07-05 10:17:48,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1571 transitions. [2021-07-05 10:17:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-05 10:17:48,570 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:48,570 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:48,570 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-05 10:17:48,570 INFO L374 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:48,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash 736088965, now seen corresponding path program 1 times [2021-07-05 10:17:48,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:48,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922942187] [2021-07-05 10:17:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:48,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:48,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:48,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:48,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:48,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:48,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:48,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:48,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922942187] [2021-07-05 10:17:48,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922942187] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:48,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:48,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:17:48,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836342989] [2021-07-05 10:17:48,593 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:17:48,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:48,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:17:48,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:48,594 INFO L87 Difference]: Start difference. First operand 1207 states and 1571 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-07-05 10:17:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:48,721 INFO L93 Difference]: Finished difference Result 3013 states and 3937 transitions. [2021-07-05 10:17:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:17:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2021-07-05 10:17:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:48,726 INFO L225 Difference]: With dead ends: 3013 [2021-07-05 10:17:48,726 INFO L226 Difference]: Without dead ends: 1837 [2021-07-05 10:17:48,728 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:17:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2021-07-05 10:17:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1219. [2021-07-05 10:17:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1218 states have (on average 1.2791461412151068) internal successors, (1558), 1218 states have internal predecessors, (1558), 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-07-05 10:17:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1558 transitions. [2021-07-05 10:17:48,786 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1558 transitions. Word has length 81 [2021-07-05 10:17:48,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:48,786 INFO L442 AbstractCegarLoop]: Abstraction has 1219 states and 1558 transitions. [2021-07-05 10:17:48,786 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-07-05 10:17:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1558 transitions. [2021-07-05 10:17:48,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-07-05 10:17:48,787 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:48,787 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:48,787 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-05 10:17:48,787 INFO L374 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:48,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash -284979389, now seen corresponding path program 1 times [2021-07-05 10:17:48,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:48,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730587241] [2021-07-05 10:17:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:48,788 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:48,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:48,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:48,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:48,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:48,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:48,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730587241] [2021-07-05 10:17:48,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730587241] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:48,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:48,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:48,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375174457] [2021-07-05 10:17:48,805 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:48,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:48,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:48,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:48,806 INFO L87 Difference]: Start difference. First operand 1219 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-07-05 10:17:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:48,925 INFO L93 Difference]: Finished difference Result 3469 states and 4420 transitions. [2021-07-05 10:17:48,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:48,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2021-07-05 10:17:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:48,930 INFO L225 Difference]: With dead ends: 3469 [2021-07-05 10:17:48,930 INFO L226 Difference]: Without dead ends: 2287 [2021-07-05 10:17:48,932 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2021-07-05 10:17:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2233. [2021-07-05 10:17:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 2232 states have (on average 1.257168458781362) internal successors, (2806), 2232 states have internal predecessors, (2806), 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-07-05 10:17:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 2806 transitions. [2021-07-05 10:17:49,059 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 2806 transitions. Word has length 81 [2021-07-05 10:17:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:49,059 INFO L442 AbstractCegarLoop]: Abstraction has 2233 states and 2806 transitions. [2021-07-05 10:17:49,060 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-07-05 10:17:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 2806 transitions. [2021-07-05 10:17:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-05 10:17:49,061 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:49,061 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:49,061 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-05 10:17:49,061 INFO L374 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:49,062 INFO L82 PathProgramCache]: Analyzing trace with hash 206796516, now seen corresponding path program 1 times [2021-07-05 10:17:49,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:49,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488193520] [2021-07-05 10:17:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:49,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:49,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:49,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:49,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:49,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:49,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:49,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:49,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:49,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488193520] [2021-07-05 10:17:49,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488193520] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:49,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:49,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:49,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304404975] [2021-07-05 10:17:49,081 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:49,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:49,081 INFO L87 Difference]: Start difference. First operand 2233 states and 2806 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-07-05 10:17:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:49,286 INFO L93 Difference]: Finished difference Result 6192 states and 7793 transitions. [2021-07-05 10:17:49,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:49,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2021-07-05 10:17:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:49,296 INFO L225 Difference]: With dead ends: 6192 [2021-07-05 10:17:49,296 INFO L226 Difference]: Without dead ends: 3996 [2021-07-05 10:17:49,298 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2021-07-05 10:17:49,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 3994. [2021-07-05 10:17:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3994 states, 3993 states have (on average 1.2489356373653895) internal successors, (4987), 3993 states have internal predecessors, (4987), 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-07-05 10:17:49,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 4987 transitions. [2021-07-05 10:17:49,501 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 4987 transitions. Word has length 82 [2021-07-05 10:17:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:49,501 INFO L442 AbstractCegarLoop]: Abstraction has 3994 states and 4987 transitions. [2021-07-05 10:17:49,501 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-07-05 10:17:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 4987 transitions. [2021-07-05 10:17:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-05 10:17:49,502 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:49,503 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:49,503 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-05 10:17:49,503 INFO L374 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:49,503 INFO L82 PathProgramCache]: Analyzing trace with hash 233862118, now seen corresponding path program 1 times [2021-07-05 10:17:49,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:49,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183521901] [2021-07-05 10:17:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:49,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:49,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:49,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:49,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:49,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:49,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:49,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:17:49,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:49,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183521901] [2021-07-05 10:17:49,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183521901] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:49,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:49,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:49,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478319645] [2021-07-05 10:17:49,515 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:49,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:49,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:49,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:49,516 INFO L87 Difference]: Start difference. First operand 3994 states and 4987 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-07-05 10:17:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:49,694 INFO L93 Difference]: Finished difference Result 7920 states and 9900 transitions. [2021-07-05 10:17:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:49,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 82 [2021-07-05 10:17:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:49,703 INFO L225 Difference]: With dead ends: 7920 [2021-07-05 10:17:49,703 INFO L226 Difference]: Without dead ends: 3963 [2021-07-05 10:17:49,706 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2021-07-05 10:17:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3963. [2021-07-05 10:17:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3962 states have (on average 1.2501261988894499) internal successors, (4953), 3962 states have internal predecessors, (4953), 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-07-05 10:17:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 4953 transitions. [2021-07-05 10:17:49,912 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 4953 transitions. Word has length 82 [2021-07-05 10:17:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:49,912 INFO L442 AbstractCegarLoop]: Abstraction has 3963 states and 4953 transitions. [2021-07-05 10:17:49,912 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-07-05 10:17:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 4953 transitions. [2021-07-05 10:17:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-07-05 10:17:49,914 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:49,914 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:49,914 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-07-05 10:17:49,914 INFO L374 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:49,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:49,914 INFO L82 PathProgramCache]: Analyzing trace with hash 794948131, now seen corresponding path program 1 times [2021-07-05 10:17:49,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:49,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757036015] [2021-07-05 10:17:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:49,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:49,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:49,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:49,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:49,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:49,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:49,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:49,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:49,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:49,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:49,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757036015] [2021-07-05 10:17:49,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757036015] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:49,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:49,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:49,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760720686] [2021-07-05 10:17:49,934 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:49,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:49,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:49,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:49,935 INFO L87 Difference]: Start difference. First operand 3963 states and 4953 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-07-05 10:17:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:50,373 INFO L93 Difference]: Finished difference Result 11096 states and 13790 transitions. [2021-07-05 10:17:50,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:17:50,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2021-07-05 10:17:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:50,388 INFO L225 Difference]: With dead ends: 11096 [2021-07-05 10:17:50,388 INFO L226 Difference]: Without dead ends: 5509 [2021-07-05 10:17:50,392 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2021-07-05 10:17:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5507. [2021-07-05 10:17:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5507 states, 5506 states have (on average 1.2197602615328733) internal successors, (6716), 5506 states have internal predecessors, (6716), 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-07-05 10:17:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5507 states to 5507 states and 6716 transitions. [2021-07-05 10:17:50,612 INFO L78 Accepts]: Start accepts. Automaton has 5507 states and 6716 transitions. Word has length 83 [2021-07-05 10:17:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:50,613 INFO L442 AbstractCegarLoop]: Abstraction has 5507 states and 6716 transitions. [2021-07-05 10:17:50,613 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-07-05 10:17:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5507 states and 6716 transitions. [2021-07-05 10:17:50,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-07-05 10:17:50,615 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:50,615 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:17:50,616 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-07-05 10:17:50,616 INFO L374 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:50,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:50,616 INFO L82 PathProgramCache]: Analyzing trace with hash -471564153, now seen corresponding path program 1 times [2021-07-05 10:17:50,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:50,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715212979] [2021-07-05 10:17:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:50,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:50,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:50,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:50,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:50,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:50,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:50,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715212979] [2021-07-05 10:17:50,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715212979] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:50,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:50,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 10:17:50,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272001447] [2021-07-05 10:17:50,633 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:50,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:50,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:50,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:50,634 INFO L87 Difference]: Start difference. First operand 5507 states and 6716 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-07-05 10:17:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:50,932 INFO L93 Difference]: Finished difference Result 12609 states and 15320 transitions. [2021-07-05 10:17:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:50,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2021-07-05 10:17:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:50,942 INFO L225 Difference]: With dead ends: 12609 [2021-07-05 10:17:50,942 INFO L226 Difference]: Without dead ends: 7128 [2021-07-05 10:17:50,947 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7128 states. [2021-07-05 10:17:51,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7128 to 7080. [2021-07-05 10:17:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7080 states, 7079 states have (on average 1.2049724537364035) internal successors, (8530), 7079 states have internal predecessors, (8530), 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-07-05 10:17:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7080 states to 7080 states and 8530 transitions. [2021-07-05 10:17:51,256 INFO L78 Accepts]: Start accepts. Automaton has 7080 states and 8530 transitions. Word has length 106 [2021-07-05 10:17:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:51,257 INFO L442 AbstractCegarLoop]: Abstraction has 7080 states and 8530 transitions. [2021-07-05 10:17:51,257 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-07-05 10:17:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 7080 states and 8530 transitions. [2021-07-05 10:17:51,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-07-05 10:17:51,261 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:51,261 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:51,261 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-07-05 10:17:51,261 INFO L374 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:51,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1818985301, now seen corresponding path program 1 times [2021-07-05 10:17:51,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:51,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922432474] [2021-07-05 10:17:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:51,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:51,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:51,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:51,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:51,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:51,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:51,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:51,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:51,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922432474] [2021-07-05 10:17:51,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922432474] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:51,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:51,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:51,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466557994] [2021-07-05 10:17:51,279 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:51,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:51,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:51,280 INFO L87 Difference]: Start difference. First operand 7080 states and 8530 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-07-05 10:17:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:51,650 INFO L93 Difference]: Finished difference Result 12582 states and 15239 transitions. [2021-07-05 10:17:51,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:51,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 121 [2021-07-05 10:17:51,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:51,660 INFO L225 Difference]: With dead ends: 12582 [2021-07-05 10:17:51,660 INFO L226 Difference]: Without dead ends: 7112 [2021-07-05 10:17:51,666 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7112 states. [2021-07-05 10:17:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7112 to 7080. [2021-07-05 10:17:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7080 states, 7079 states have (on average 1.1806752366153412) internal successors, (8358), 7079 states have internal predecessors, (8358), 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-07-05 10:17:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7080 states to 7080 states and 8358 transitions. [2021-07-05 10:17:52,053 INFO L78 Accepts]: Start accepts. Automaton has 7080 states and 8358 transitions. Word has length 121 [2021-07-05 10:17:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:52,053 INFO L442 AbstractCegarLoop]: Abstraction has 7080 states and 8358 transitions. [2021-07-05 10:17:52,054 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-07-05 10:17:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 7080 states and 8358 transitions. [2021-07-05 10:17:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-07-05 10:17:52,058 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:52,058 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:17:52,058 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-07-05 10:17:52,058 INFO L374 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:52,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:52,059 INFO L82 PathProgramCache]: Analyzing trace with hash -654472485, now seen corresponding path program 1 times [2021-07-05 10:17:52,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:52,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791080083] [2021-07-05 10:17:52,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:52,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:52,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:52,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:52,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:52,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:52,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:52,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:52,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:52,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:52,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:52,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791080083] [2021-07-05 10:17:52,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791080083] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:52,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:52,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:52,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136744867] [2021-07-05 10:17:52,081 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:52,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:52,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:52,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:52,082 INFO L87 Difference]: Start difference. First operand 7080 states and 8358 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-07-05 10:17:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:52,422 INFO L93 Difference]: Finished difference Result 12556 states and 14866 transitions. [2021-07-05 10:17:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:17:52,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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 122 [2021-07-05 10:17:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:52,431 INFO L225 Difference]: With dead ends: 12556 [2021-07-05 10:17:52,431 INFO L226 Difference]: Without dead ends: 7086 [2021-07-05 10:17:52,435 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7086 states. [2021-07-05 10:17:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7086 to 7080. [2021-07-05 10:17:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7080 states, 7079 states have (on average 1.1755897725667468) internal successors, (8322), 7079 states have internal predecessors, (8322), 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-07-05 10:17:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7080 states to 7080 states and 8322 transitions. [2021-07-05 10:17:52,714 INFO L78 Accepts]: Start accepts. Automaton has 7080 states and 8322 transitions. Word has length 122 [2021-07-05 10:17:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:52,714 INFO L442 AbstractCegarLoop]: Abstraction has 7080 states and 8322 transitions. [2021-07-05 10:17:52,714 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-07-05 10:17:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 7080 states and 8322 transitions. [2021-07-05 10:17:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-07-05 10:17:52,719 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:52,719 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:17:52,719 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-07-05 10:17:52,719 INFO L374 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:52,720 INFO L82 PathProgramCache]: Analyzing trace with hash -956339995, now seen corresponding path program 1 times [2021-07-05 10:17:52,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:52,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343710672] [2021-07-05 10:17:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:52,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:52,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:52,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:52,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:52,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:52,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:52,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:52,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:52,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-05 10:17:52,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:52,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343710672] [2021-07-05 10:17:52,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343710672] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:52,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:52,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:52,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640897272] [2021-07-05 10:17:52,746 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:52,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:52,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:52,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:52,746 INFO L87 Difference]: Start difference. First operand 7080 states and 8322 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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-07-05 10:17:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:53,099 INFO L93 Difference]: Finished difference Result 14322 states and 16826 transitions. [2021-07-05 10:17:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:17:53,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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 148 [2021-07-05 10:17:53,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:53,108 INFO L225 Difference]: With dead ends: 14322 [2021-07-05 10:17:53,108 INFO L226 Difference]: Without dead ends: 6474 [2021-07-05 10:17:53,114 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6474 states. [2021-07-05 10:17:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6474 to 6273. [2021-07-05 10:17:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6273 states, 6272 states have (on average 1.1685267857142858) internal successors, (7329), 6272 states have internal predecessors, (7329), 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-07-05 10:17:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6273 states to 6273 states and 7329 transitions. [2021-07-05 10:17:53,369 INFO L78 Accepts]: Start accepts. Automaton has 6273 states and 7329 transitions. Word has length 148 [2021-07-05 10:17:53,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:53,369 INFO L442 AbstractCegarLoop]: Abstraction has 6273 states and 7329 transitions. [2021-07-05 10:17:53,369 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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-07-05 10:17:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 6273 states and 7329 transitions. [2021-07-05 10:17:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-07-05 10:17:53,372 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:53,372 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:17:53,372 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-07-05 10:17:53,373 INFO L374 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:53,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:53,373 INFO L82 PathProgramCache]: Analyzing trace with hash 199848580, now seen corresponding path program 1 times [2021-07-05 10:17:53,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:53,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416671269] [2021-07-05 10:17:53,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:53,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:53,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:53,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:53,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:53,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:53,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:53,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-05 10:17:53,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:53,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416671269] [2021-07-05 10:17:53,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416671269] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:53,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:53,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:53,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293599838] [2021-07-05 10:17:53,394 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:53,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:53,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:53,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:53,394 INFO L87 Difference]: Start difference. First operand 6273 states and 7329 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-07-05 10:17:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:53,683 INFO L93 Difference]: Finished difference Result 10733 states and 12580 transitions. [2021-07-05 10:17:53,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:53,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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 149 [2021-07-05 10:17:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:53,690 INFO L225 Difference]: With dead ends: 10733 [2021-07-05 10:17:53,690 INFO L226 Difference]: Without dead ends: 6557 [2021-07-05 10:17:53,693 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2021-07-05 10:17:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 6273. [2021-07-05 10:17:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6273 states, 6272 states have (on average 1.1493941326530612) internal successors, (7209), 6272 states have internal predecessors, (7209), 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-07-05 10:17:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6273 states to 6273 states and 7209 transitions. [2021-07-05 10:17:53,953 INFO L78 Accepts]: Start accepts. Automaton has 6273 states and 7209 transitions. Word has length 149 [2021-07-05 10:17:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:53,953 INFO L442 AbstractCegarLoop]: Abstraction has 6273 states and 7209 transitions. [2021-07-05 10:17:53,953 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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-07-05 10:17:53,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6273 states and 7209 transitions. [2021-07-05 10:17:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-07-05 10:17:53,956 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:53,956 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:17:53,956 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-07-05 10:17:53,956 INFO L374 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash 965086109, now seen corresponding path program 1 times [2021-07-05 10:17:53,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:53,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7516008] [2021-07-05 10:17:53,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:53,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:53,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:53,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:53,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:53,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:53,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:53,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:53,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:53,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-05 10:17:53,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:53,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7516008] [2021-07-05 10:17:53,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7516008] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:53,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:53,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:53,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034258230] [2021-07-05 10:17:53,981 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:53,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:53,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:53,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:53,981 INFO L87 Difference]: Start difference. First operand 6273 states and 7209 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-07-05 10:17:54,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:54,144 INFO L93 Difference]: Finished difference Result 9025 states and 10279 transitions. [2021-07-05 10:17:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:17:54,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 150 [2021-07-05 10:17:54,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:54,147 INFO L225 Difference]: With dead ends: 9025 [2021-07-05 10:17:54,147 INFO L226 Difference]: Without dead ends: 1871 [2021-07-05 10:17:54,151 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2021-07-05 10:17:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1866. [2021-07-05 10:17:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 1.0739946380697052) internal successors, (2003), 1865 states have internal predecessors, (2003), 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-07-05 10:17:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2003 transitions. [2021-07-05 10:17:54,230 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 2003 transitions. Word has length 150 [2021-07-05 10:17:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:54,231 INFO L442 AbstractCegarLoop]: Abstraction has 1866 states and 2003 transitions. [2021-07-05 10:17:54,231 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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-07-05 10:17:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2003 transitions. [2021-07-05 10:17:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-07-05 10:17:54,232 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:54,232 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:17:54,232 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-07-05 10:17:54,232 INFO L374 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1275276035, now seen corresponding path program 1 times [2021-07-05 10:17:54,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:54,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660802039] [2021-07-05 10:17:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:54,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:54,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:54,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:54,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:54,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:54,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:54,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:54,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:54,255 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660802039] [2021-07-05 10:17:54,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660802039] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:54,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:54,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:54,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941679477] [2021-07-05 10:17:54,256 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:54,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:54,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:54,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:54,256 INFO L87 Difference]: Start difference. First operand 1866 states and 2003 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-07-05 10:17:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:54,358 INFO L93 Difference]: Finished difference Result 2502 states and 2691 transitions. [2021-07-05 10:17:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:54,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 150 [2021-07-05 10:17:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:54,360 INFO L225 Difference]: With dead ends: 2502 [2021-07-05 10:17:54,360 INFO L226 Difference]: Without dead ends: 1505 [2021-07-05 10:17:54,361 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:54,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2021-07-05 10:17:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2021-07-05 10:17:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.0704787234042554) internal successors, (1610), 1504 states have internal predecessors, (1610), 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-07-05 10:17:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1610 transitions. [2021-07-05 10:17:54,444 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1610 transitions. Word has length 150 [2021-07-05 10:17:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:54,445 INFO L442 AbstractCegarLoop]: Abstraction has 1505 states and 1610 transitions. [2021-07-05 10:17:54,445 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-07-05 10:17:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1610 transitions. [2021-07-05 10:17:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-07-05 10:17:54,446 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:54,446 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:17:54,446 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-07-05 10:17:54,446 INFO L374 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:54,447 INFO L82 PathProgramCache]: Analyzing trace with hash -660923245, now seen corresponding path program 1 times [2021-07-05 10:17:54,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:54,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391943135] [2021-07-05 10:17:54,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:54,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:54,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:54,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:54,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:54,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-05 10:17:54,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:54,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-07-05 10:17:54,506 INFO L142 QuantifierPusher]: treesize reduction 13, result has 45.8 percent of original size [2021-07-05 10:17:54,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-07-05 10:17:54,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:54,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-05 10:17:54,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:54,517 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391943135] [2021-07-05 10:17:54,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391943135] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:54,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:54,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:17:54,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375617721] [2021-07-05 10:17:54,518 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:17:54,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:54,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:17:54,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:54,519 INFO L87 Difference]: Start difference. First operand 1505 states and 1610 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-07-05 10:17:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:54,643 INFO L93 Difference]: Finished difference Result 1505 states and 1610 transitions. [2021-07-05 10:17:54,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:17:54,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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 152 [2021-07-05 10:17:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:54,644 INFO L225 Difference]: With dead ends: 1505 [2021-07-05 10:17:54,644 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 10:17:54,645 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.0ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 10:17:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 10:17:54,646 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-07-05 10:17:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 10:17:54,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 152 [2021-07-05 10:17:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:54,646 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 10:17:54,646 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-07-05 10:17:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 10:17:54,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 10:17:54,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 10:17:54,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:54,806 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 161 [2021-07-05 10:17:54,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,174 WARN L205 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 226 [2021-07-05 10:17:55,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,301 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 144 [2021-07-05 10:17:55,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,419 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 180 [2021-07-05 10:17:55,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,640 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 176 [2021-07-05 10:17:55,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,648 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:55,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:56,026 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 221 [2021-07-05 10:17:56,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:56,142 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 207 [2021-07-05 10:17:56,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:56,294 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 206 [2021-07-05 10:17:56,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:56,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:56,461 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 188 [2021-07-05 10:17:56,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:56,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:56,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:56,651 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:56,803 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 210 [2021-07-05 10:17:56,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:56,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:56,960 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 210 [2021-07-05 10:17:56,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:57,118 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 221 [2021-07-05 10:17:57,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:57,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:57,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:57,299 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 208 [2021-07-05 10:17:57,300 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:57,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:57,507 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 210 [2021-07-05 10:17:57,508 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:57,662 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 221 [2021-07-05 10:17:57,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:57,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:57,837 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 210 [2021-07-05 10:17:57,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:57,988 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 208 [2021-07-05 10:17:57,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:58,138 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 210 [2021-07-05 10:17:58,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:58,170 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:58,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:58,383 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 210 [2021-07-05 10:17:58,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:58,407 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:58,560 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 210 [2021-07-05 10:17:58,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:58,719 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 221 [2021-07-05 10:17:58,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:58,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:58,919 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 221 [2021-07-05 10:17:58,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:58,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:59,130 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 210 [2021-07-05 10:17:59,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:59,288 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 221 [2021-07-05 10:17:59,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:59,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:59,555 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 210 [2021-07-05 10:17:59,556 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:59,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:59,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:59,812 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 266 [2021-07-05 10:17:59,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:59,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:59,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:59,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,113 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 221 [2021-07-05 10:18:00,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,324 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 206 [2021-07-05 10:18:00,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,546 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 241 DAG size of output: 221 [2021-07-05 10:18:00,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,808 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 210 [2021-07-05 10:18:00,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:00,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:18:01,056 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 228 [2021-07-05 10:18:01,597 WARN L205 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 65 [2021-07-05 10:18:03,198 WARN L205 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 218 DAG size of output: 90 [2021-07-05 10:18:03,400 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2021-07-05 10:18:03,716 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 62 [2021-07-05 10:18:04,217 WARN L205 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 71 [2021-07-05 10:18:05,329 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 102 DAG size of output: 99 [2021-07-05 10:18:05,614 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 66 [2021-07-05 10:18:05,998 WARN L205 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 64 [2021-07-05 10:18:06,154 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2021-07-05 10:18:06,313 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2021-07-05 10:18:06,474 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2021-07-05 10:18:06,951 WARN L205 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 75 [2021-07-05 10:18:07,394 WARN L205 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 65 [2021-07-05 10:18:07,583 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2021-07-05 10:18:08,765 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 98 DAG size of output: 95 [2021-07-05 10:18:10,404 WARN L205 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 216 DAG size of output: 99 [2021-07-05 10:18:10,952 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 73 [2021-07-05 10:18:12,431 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 203 DAG size of output: 95 [2021-07-05 10:18:12,955 WARN L205 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 76 [2021-07-05 10:18:13,405 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 69 [2021-07-05 10:18:14,065 WARN L205 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-07-05 10:18:14,568 WARN L205 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 71 [2021-07-05 10:18:15,071 WARN L205 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 67 [2021-07-05 10:18:16,761 WARN L205 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 207 DAG size of output: 99 [2021-07-05 10:18:17,027 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2021-07-05 10:18:18,712 WARN L205 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 207 DAG size of output: 99 [2021-07-05 10:18:20,325 WARN L205 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 216 DAG size of output: 99 [2021-07-05 10:18:21,647 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2021-07-05 10:18:23,221 WARN L205 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 205 DAG size of output: 97 [2021-07-05 10:18:23,792 WARN L205 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 78 [2021-07-05 10:18:25,289 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 207 DAG size of output: 99 [2021-07-05 10:18:26,932 WARN L205 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 216 DAG size of output: 99 [2021-07-05 10:18:28,267 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2021-07-05 10:18:30,025 WARN L205 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 207 DAG size of output: 99 [2021-07-05 10:18:31,627 WARN L205 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 202 DAG size of output: 90 [2021-07-05 10:18:33,393 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 207 DAG size of output: 99 [2021-07-05 10:18:34,774 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 102 DAG size of output: 99 [2021-07-05 10:18:35,330 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 72 [2021-07-05 10:18:37,060 WARN L205 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 207 DAG size of output: 99 [2021-07-05 10:18:37,363 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 57 [2021-07-05 10:18:38,858 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 207 DAG size of output: 99 [2021-07-05 10:18:40,250 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 216 DAG size of output: 99 [2021-07-05 10:18:40,613 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 64 [2021-07-05 10:18:42,035 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 216 DAG size of output: 99 [2021-07-05 10:18:42,622 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 80 [2021-07-05 10:18:44,304 WARN L205 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 207 DAG size of output: 99 [2021-07-05 10:18:45,920 WARN L205 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 216 DAG size of output: 99 [2021-07-05 10:18:46,656 WARN L205 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 83 [2021-07-05 10:18:48,315 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 207 DAG size of output: 99 [2021-07-05 10:18:48,899 WARN L205 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 70 [2021-07-05 10:18:50,317 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 257 DAG size of output: 91 [2021-07-05 10:18:50,841 WARN L205 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 69 [2021-07-05 10:18:51,166 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 64 [2021-07-05 10:18:52,513 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2021-07-05 10:18:54,116 WARN L205 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 216 DAG size of output: 99 [2021-07-05 10:18:54,640 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 61 [2021-07-05 10:18:56,244 WARN L205 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 200 DAG size of output: 92 [2021-07-05 10:18:56,452 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2021-07-05 10:18:57,017 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 74 [2021-07-05 10:18:58,335 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 216 DAG size of output: 99 [2021-07-05 10:18:58,781 WARN L205 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 66 [2021-07-05 10:18:59,046 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 59 [2021-07-05 10:19:00,745 WARN L205 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 207 DAG size of output: 99 [2021-07-05 10:19:00,921 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2021-07-05 10:19:01,209 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2021-07-05 10:19:01,866 WARN L205 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-07-05 10:19:02,035 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 55 [2021-07-05 10:19:03,622 WARN L205 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 220 DAG size of output: 88 [2021-07-05 10:19:03,625 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-07-05 10:19:03,625 INFO L762 garLoopResultBuilder]: For program point L498-1(lines 477 510) no Hoare annotation was computed. [2021-07-05 10:19:03,626 INFO L758 garLoopResultBuilder]: At program point L102(lines 97 128) the Hoare annotation is: (let ((.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 1))) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse8 (not (= ~t1_st~0 0))) (.cse9 (not (= ~E_2~0 1))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_M~0 0))) (.cse13 (not (= ~T1_E~0 0))) (.cse14 (not (= ~T2_E~0 1))) (.cse15 (= ~t1_i~0 1)) (.cse12 (= 0 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~t2_pc~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse13 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse15 (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ~m_pc~0 0)) (and .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 (= ~t1_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~local~0 ~token~0) .cse11 .cse13 .cse14 (= ~t2_pc~0 1) .cse15 (not .cse12)))) [2021-07-05 10:19:03,626 INFO L762 garLoopResultBuilder]: For program point L235-1(lines 234 252) no Hoare annotation was computed. [2021-07-05 10:19:03,626 INFO L762 garLoopResultBuilder]: For program point L368-1(lines 347 380) no Hoare annotation was computed. [2021-07-05 10:19:03,626 INFO L762 garLoopResultBuilder]: For program point L368-3(lines 347 380) no Hoare annotation was computed. [2021-07-05 10:19:03,626 INFO L762 garLoopResultBuilder]: For program point L170(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,626 INFO L762 garLoopResultBuilder]: For program point L170-2(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,626 INFO L762 garLoopResultBuilder]: For program point L170-3(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,626 INFO L762 garLoopResultBuilder]: For program point L170-5(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,627 INFO L762 garLoopResultBuilder]: For program point L170-6(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,627 INFO L762 garLoopResultBuilder]: For program point L170-8(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,627 INFO L762 garLoopResultBuilder]: For program point L170-9(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,627 INFO L762 garLoopResultBuilder]: For program point L170-11(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,627 INFO L762 garLoopResultBuilder]: For program point L170-12(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,627 INFO L762 garLoopResultBuilder]: For program point L170-14(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,627 INFO L762 garLoopResultBuilder]: For program point L170-15(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,627 INFO L762 garLoopResultBuilder]: For program point L170-17(lines 170 179) no Hoare annotation was computed. [2021-07-05 10:19:03,627 INFO L762 garLoopResultBuilder]: For program point L171(lines 171 176) no Hoare annotation was computed. [2021-07-05 10:19:03,627 INFO L762 garLoopResultBuilder]: For program point L171-1(lines 171 176) no Hoare annotation was computed. [2021-07-05 10:19:03,628 INFO L762 garLoopResultBuilder]: For program point L171-2(lines 171 176) no Hoare annotation was computed. [2021-07-05 10:19:03,628 INFO L762 garLoopResultBuilder]: For program point L171-3(lines 171 176) no Hoare annotation was computed. [2021-07-05 10:19:03,628 INFO L762 garLoopResultBuilder]: For program point L171-4(lines 171 176) no Hoare annotation was computed. [2021-07-05 10:19:03,628 INFO L762 garLoopResultBuilder]: For program point L171-5(lines 171 176) no Hoare annotation was computed. [2021-07-05 10:19:03,628 INFO L762 garLoopResultBuilder]: For program point L437(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,628 INFO L762 garLoopResultBuilder]: For program point L437-2(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,628 INFO L762 garLoopResultBuilder]: For program point L437-3(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,628 INFO L762 garLoopResultBuilder]: For program point L437-5(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,628 INFO L762 garLoopResultBuilder]: For program point L437-6(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,628 INFO L762 garLoopResultBuilder]: For program point L437-8(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,628 INFO L762 garLoopResultBuilder]: For program point L437-9(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,629 INFO L762 garLoopResultBuilder]: For program point L437-11(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,629 INFO L762 garLoopResultBuilder]: For program point L437-12(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,629 INFO L762 garLoopResultBuilder]: For program point L437-14(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,629 INFO L762 garLoopResultBuilder]: For program point L437-15(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,629 INFO L762 garLoopResultBuilder]: For program point L437-17(lines 437 441) no Hoare annotation was computed. [2021-07-05 10:19:03,629 INFO L762 garLoopResultBuilder]: For program point L240-1(lines 234 252) no Hoare annotation was computed. [2021-07-05 10:19:03,629 INFO L762 garLoopResultBuilder]: For program point L42(lines 42 50) no Hoare annotation was computed. [2021-07-05 10:19:03,629 INFO L758 garLoopResultBuilder]: At program point L373-1(lines 344 381) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_2~0 ~M_E~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~T2_E~0 ~M_E~0)) (.cse5 (= ~t2_i~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~M_E~0 2)) (.cse10 (= ~t1_i~0 1)) (.cse11 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ~t2_pc~0) (<= ~local~0 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-07-05 10:19:03,630 INFO L758 garLoopResultBuilder]: At program point L373-3(lines 344 381) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse30 (= ~t1_pc~0 1))) (let ((.cse14 (= 0 ~t2_pc~0)) (.cse12 (= ~m_pc~0 1)) (.cse16 (not (= ~m_st~0 0))) (.cse3 (not (= ~E_1~0 1))) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse4 (not .cse30)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse23 (not (= ~t1_st~0 0))) (.cse15 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse26 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse27 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse31 (= ~t2_pc~0 1)) (.cse22 (= ~t1_i~0 1)) (.cse32 (not .cse18)) (.cse28 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse29 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse2 .cse6 .cse7 .cse8 .cse10 .cse11 .cse15 .cse16 .cse17 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse15 .cse16 .cse25 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse14 .cse23 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse23 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29)))) [2021-07-05 10:19:03,630 INFO L758 garLoopResultBuilder]: At program point L109-1(lines 97 128) the Hoare annotation is: (let ((.cse23 (= 0 ~t2_st~0))) (let ((.cse17 (not .cse23)) (.cse2 (<= ~token~0 ~local~0)) (.cse22 (= 0 ~t2_pc~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse12 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse18 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse19 (= ~m_pc~0 0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 1))) (.cse3 (not (= ~E_2~0 0))) (.cse4 (not (= ~T2_E~0 0))) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse21 (= ~m_pc~0 1)) (.cse8 (not (= ~E_2~0 1))) (.cse20 (not (= ~m_st~0 0))) (.cse10 (not (= ~E_M~0 0))) (.cse11 (not (= ~T1_E~0 0))) (.cse13 (not (= ~T2_E~0 1))) (.cse15 (= ~t2_pc~0 1)) (.cse16 (= ~t1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse20 .cse10 .cse23 .cse11 .cse13 .cse16) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse20 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse19) (let ((.cse24 (+ ~local~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~token~0 .cse24) .cse6 (= ~t1_pc~0 1) .cse7 .cse21 .cse8 .cse20 .cse10 .cse11 .cse13 .cse15 .cse16 (<= .cse24 ~token~0)))))) [2021-07-05 10:19:03,630 INFO L762 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2021-07-05 10:19:03,630 INFO L758 garLoopResultBuilder]: At program point L309(lines 285 337) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse30 (= ~t1_pc~0 1))) (let ((.cse14 (= 0 ~t2_pc~0)) (.cse12 (= ~m_pc~0 1)) (.cse16 (not (= ~m_st~0 0))) (.cse3 (not (= ~E_1~0 1))) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse4 (not .cse30)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse23 (not (= ~t1_st~0 0))) (.cse15 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse26 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse27 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse31 (= ~t2_pc~0 1)) (.cse22 (= ~t1_i~0 1)) (.cse32 (not .cse18)) (.cse28 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse29 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse2 .cse6 .cse7 .cse8 .cse10 .cse11 .cse15 .cse16 .cse17 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse15 .cse16 .cse25 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse14 .cse23 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse23 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29)))) [2021-07-05 10:19:03,630 INFO L762 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-07-05 10:19:03,631 INFO L758 garLoopResultBuilder]: At program point L46(lines 41 92) the Hoare annotation is: (and (not (= ~E_M~0 1)) (not (= ~E_1~0 1)) (< ~token~0 (+ 3 ~local~0)) (not (= ~E_2~0 0)) (not (= ~T2_E~0 0)) (not (= ~T1_E~0 1)) (not (= ~E_1~0 0)) (= ~t1_pc~0 1) (= ~t2_i~0 1) (= ~m_pc~0 1) (not (= ~t1_st~0 0)) (not (= ~E_2~0 1)) (not (= ~m_st~0 0)) (not (= ~E_M~0 0)) (<= (+ 2 ~local~0) ~token~0) (not (= ~T1_E~0 0)) (not (= ~T2_E~0 1)) (= ~t2_pc~0 1) (= ~t1_i~0 1) (not (= 0 ~t2_st~0))) [2021-07-05 10:19:03,631 INFO L758 garLoopResultBuilder]: At program point L245-1(lines 348 352) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_2~0 ~M_E~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~T2_E~0 ~M_E~0)) (.cse5 (= ~t2_i~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~M_E~0 2)) (.cse10 (= ~t1_i~0 1)) (.cse11 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ~t2_pc~0) (<= ~local~0 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-07-05 10:19:03,631 INFO L762 garLoopResultBuilder]: For program point L576(lines 576 585) no Hoare annotation was computed. [2021-07-05 10:19:03,631 INFO L758 garLoopResultBuilder]: At program point L576-1(lines 576 585) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,631 INFO L762 garLoopResultBuilder]: For program point L312(lines 312 319) no Hoare annotation was computed. [2021-07-05 10:19:03,631 INFO L762 garLoopResultBuilder]: For program point L445(lines 445 449) no Hoare annotation was computed. [2021-07-05 10:19:03,631 INFO L758 garLoopResultBuilder]: At program point L445-2(lines 386 390) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= ~E_2~0 ~M_E~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~E_1~0 ~M_E~0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse8 (= ~T2_E~0 ~M_E~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (= ~t1_st~0 0)) (.cse14 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse16 (= ~M_E~0 2)) (.cse17 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse18 (= ~t1_i~0 1)) (.cse19 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse20 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ~t2_pc~0) (<= ~local~0 ~token~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ~m_st~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-07-05 10:19:03,632 INFO L762 garLoopResultBuilder]: For program point L445-3(lines 445 449) no Hoare annotation was computed. [2021-07-05 10:19:03,632 INFO L758 garLoopResultBuilder]: At program point L445-5(lines 1 612) the Hoare annotation is: (let ((.cse23 (= 0 ~t2_st~0)) (.cse25 (= ~t1_pc~0 1))) (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (not .cse25)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse24 (<= ~token~0 ~local~0)) (.cse21 (= 0 ~t2_pc~0)) (.cse26 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse4 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse5 (not (= ~E_2~0 0))) (.cse6 (not (= ~T2_E~0 0))) (.cse7 (not (= ~T1_E~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse22 (not (= ~t1_st~0 0))) (.cse12 (not (= ~E_2~0 1))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_M~0 0))) (.cse15 (not (= ~T1_E~0 0))) (.cse16 (not (= ~T2_E~0 1))) (.cse17 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse18 (= ~t2_pc~0 1)) (.cse19 (= ~t1_i~0 1)) (.cse20 (not .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse21 .cse22 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse19) (and .cse2 .cse4 .cse24 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse2 .cse4 .cse24 .cse5 .cse6 .cse7 .cse9 .cse25 .cse10 .cse11 .cse21 .cse12 .cse13 .cse26 .cse14 .cse23 .cse15 .cse16 .cse17 .cse19) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-07-05 10:19:03,632 INFO L762 garLoopResultBuilder]: For program point L445-6(lines 445 449) no Hoare annotation was computed. [2021-07-05 10:19:03,632 INFO L758 garLoopResultBuilder]: At program point L181(lines 169 183) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_2~0 ~M_E~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~T2_E~0 ~M_E~0)) (.cse5 (= ~t2_i~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (= ~M_E~0 2)) (.cse11 (= ~t1_i~0 1)) (.cse12 (= ~m_pc~0 0))) (or (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ~t2_pc~0) (<= ~local~0 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-07-05 10:19:03,632 INFO L758 garLoopResultBuilder]: At program point L445-8(lines 1 612) the Hoare annotation is: (let ((.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 1))) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~m_pc~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ~E_M~0 0))) (.cse11 (not (= ~T1_E~0 0))) (.cse12 (not (= ~T2_E~0 1))) (.cse13 (= ~t2_pc~0 1)) (.cse14 (= ~t1_i~0 1)) (.cse15 (= 0 ~t2_st~0))) (or (let ((.cse5 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 (= ~t1_pc~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= .cse5 ~token~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (= 0 ~t2_pc~0) .cse9 .cse10 .cse15 .cse11 .cse12 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse14 (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ~m_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not .cse15)))) [2021-07-05 10:19:03,632 INFO L758 garLoopResultBuilder]: At program point L181-1(lines 169 183) the Hoare annotation is: (let ((.cse6 (= ~t1_pc~0 1)) (.cse25 (= 0 ~t2_st~0))) (let ((.cse16 (= ~t2_pc~0 1)) (.cse18 (not .cse25)) (.cse1 (<= ~token~0 ~local~0)) (.cse8 (not (= ~t1_st~0 0))) (.cse11 (<= ~local~0 ~token~0)) (.cse19 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse20 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (not (= ~E_M~0 1))) (.cse21 (not .cse6)) (.cse22 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse24 (= 0 ~t2_pc~0)) (.cse9 (not (= ~E_2~0 1))) (.cse10 (not (= ~m_st~0 0))) (.cse12 (not (= ~E_M~0 0))) (.cse13 (not (= ~T1_E~0 0))) (.cse14 (not (= ~T2_E~0 1))) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse17 (= ~t1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse20 .cse0 .cse21 .cse22 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse14 .cse15 .cse17) (and .cse19 .cse20 .cse0 .cse21 .cse22 .cse2 .cse3 .cse4 .cse5 .cse7 .cse24 .cse9 .cse10 .cse12 .cse25 .cse13 .cse14 .cse15 .cse23 .cse17)))) [2021-07-05 10:19:03,632 INFO L762 garLoopResultBuilder]: For program point L445-9(lines 445 449) no Hoare annotation was computed. [2021-07-05 10:19:03,633 INFO L758 garLoopResultBuilder]: At program point L181-2(lines 169 183) the Hoare annotation is: (let ((.cse0 (not (= ~E_M~0 1))) (.cse12 (not (= ~E_1~0 1))) (.cse1 (not (= ~E_2~0 0))) (.cse2 (not (= ~T2_E~0 0))) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (not (= ~E_1~0 0))) (.cse5 (= ~t2_i~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_M~0 0))) (.cse8 (not (= ~T1_E~0 0))) (.cse9 (not (= ~T2_E~0 1))) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= ~t1_i~0 1)) (.cse15 (= 0 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~m_pc~0 0)) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 (= 0 ~t2_pc~0) .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (let ((.cse16 (+ ~local~0 1))) (and .cse0 .cse12 .cse1 .cse2 .cse3 (<= ~token~0 .cse16) .cse4 (= ~t1_pc~0 1) .cse5 .cse13 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~t2_pc~0 1) .cse11 (not .cse15) (<= .cse16 ~token~0))))) [2021-07-05 10:19:03,633 INFO L758 garLoopResultBuilder]: At program point L181-3(lines 169 183) the Hoare annotation is: (let ((.cse22 (= ~t1_pc~0 1))) (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not .cse22)) (.cse3 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse16 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse21 (not (= ~E_1~0 1))) (.cse23 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0))) (.cse17 (= ~t2_pc~0 1)) (.cse19 (not (= 0 ~t2_st~0))) (.cse4 (not (= ~E_2~0 0))) (.cse5 (not (= ~T2_E~0 0))) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse10 (not (= ~E_2~0 1))) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~E_M~0 0))) (.cse13 (not (= ~T1_E~0 0))) (.cse14 (not (= ~T2_E~0 1))) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse18 (= ~t1_i~0 1)) (.cse20 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 (< ~token~0 (+ 3 ~local~0)) .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 (<= (+ 2 ~local~0) ~token~0) .cse13 .cse14 .cse17 .cse18 .cse19) (and .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse20)))) [2021-07-05 10:19:03,633 INFO L758 garLoopResultBuilder]: At program point L445-11(lines 1 612) the Hoare annotation is: (let ((.cse27 (= ~t1_pc~0 1))) (let ((.cse11 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse16 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse17 (= ~m_pc~0 0)) (.cse18 (not (= ~E_1~0 1))) (.cse19 (= ~m_pc~0 1)) (.cse23 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse24 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse25 (not .cse27)) (.cse0 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse1 (not (= ~E_2~0 0))) (.cse2 (not (= ~T2_E~0 0))) (.cse3 (not (= ~T1_E~0 1))) (.cse26 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse4 (not (= ~E_1~0 0))) (.cse5 (= ~t2_i~0 1)) (.cse6 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse20 (not (= ~t1_st~0 0))) (.cse7 (not (= ~E_2~0 1))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_M~0 0))) (.cse10 (not (= ~T1_E~0 0))) (.cse12 (not (= ~T2_E~0 1))) (.cse14 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse21 (= ~t2_pc~0 1)) (.cse15 (= ~t1_i~0 1)) (.cse22 (not (= 0 ~t2_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse21 .cse15 .cse22) (and .cse23 .cse24 .cse25 .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse15 .cse22 .cse16 .cse17) (and .cse18 (< ~token~0 (+ 3 ~local~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse27 .cse5 .cse19 .cse6 .cse20 .cse7 .cse9 (<= (+ 2 ~local~0) ~token~0) .cse10 .cse12 .cse14 .cse21 .cse15 .cse22) (and .cse23 .cse24 .cse25 .cse0 .cse1 .cse2 .cse3 .cse26 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse21 .cse15 .cse22)))) [2021-07-05 10:19:03,633 INFO L758 garLoopResultBuilder]: At program point L181-4(lines 169 183) the Hoare annotation is: (let ((.cse19 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse18 (= 0 ~t2_pc~0)) (.cse20 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse22 (not .cse29)) (.cse23 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse26 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse27 (= ~m_pc~0 0)) (.cse24 (<= ~token~0 ~local~0)) (.cse10 (not (= ~m_st~0 0))) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 1))) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse8 (not (= ~t1_st~0 0))) (.cse9 (not (= ~E_2~0 1))) (.cse11 (not (= ~E_M~0 0))) (.cse12 (not (= ~T1_E~0 0))) (.cse13 (not (= ~T2_E~0 1))) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= ~t2_pc~0 1)) (.cse16 (= ~t1_i~0 1)) (.cse17 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse16) (and .cse20 .cse21 .cse0 .cse1 .cse22 .cse23 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse9 .cse25 .cse11 .cse19 .cse12 .cse13 .cse14 .cse26 .cse16 .cse27) (and .cse20 .cse21 .cse0 .cse1 .cse22 .cse23 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse25 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse20 .cse21 .cse0 .cse1 .cse22 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse26 .cse16) (let ((.cse28 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse28) .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= .cse28 ~token~0))) (and .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse29 .cse6 .cse18 .cse8 .cse9 .cse25 .cse11 .cse19 .cse12 .cse13 .cse14 .cse16 .cse27) (and .cse20 .cse21 .cse0 .cse22 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse20 .cse21 .cse0 .cse22 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse26 .cse16) (and .cse20 .cse21 .cse0 .cse22 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse8 .cse9 .cse11 .cse19 .cse12 .cse13 .cse14 .cse26 .cse16 .cse27) (and .cse20 .cse21 .cse0 .cse1 .cse22 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse29 .cse6 .cse7 .cse18 .cse9 .cse10 .cse25 .cse11 .cse19 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse27) (and .cse20 .cse21 .cse0 .cse22 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse29 .cse6 .cse8 .cse9 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse29 .cse6 .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 (< ~token~0 (+ 3 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse11 (<= (+ 2 ~local~0) ~token~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2021-07-05 10:19:03,633 INFO L762 garLoopResultBuilder]: For program point L445-12(lines 445 449) no Hoare annotation was computed. [2021-07-05 10:19:03,634 INFO L758 garLoopResultBuilder]: At program point L181-5(lines 169 183) the Hoare annotation is: (let ((.cse16 (= 0 ~t2_st~0)) (.cse8 (= ~t1_pc~0 1))) (let ((.cse11 (= 0 ~t2_pc~0)) (.cse22 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse23 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse24 (not .cse8)) (.cse13 (not (= ~m_st~0 0))) (.cse10 (= ~m_pc~0 1)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 1))) (.cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse3 (<= ~token~0 ~local~0)) (.cse4 (not (= ~E_2~0 0))) (.cse5 (not (= ~T2_E~0 0))) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse28 (not (= ~t1_st~0 0))) (.cse12 (not (= ~E_2~0 1))) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (not (= ~E_M~0 0))) (.cse17 (not (= ~T1_E~0 0))) (.cse18 (not (= ~T2_E~0 1))) (.cse19 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse20 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse26 (= ~t2_pc~0 1)) (.cse21 (= ~t1_i~0 1)) (.cse27 (not .cse16)) (.cse25 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse22 .cse23 .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse22 .cse23 .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse28 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse22 .cse23 .cse0 .cse1 .cse24 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse22 .cse23 .cse0 .cse24 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse28 .cse12 .cse15 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27 .cse25) (let ((.cse29 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~token~0 .cse29) .cse7 .cse8 .cse9 .cse10 .cse28 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 (<= .cse29 ~token~0))) (and .cse22 .cse23 .cse0 .cse24 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse22 .cse23 .cse0 .cse24 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse28 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse25) (and .cse22 .cse23 .cse0 .cse1 .cse24 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27) (and .cse22 .cse23 .cse0 .cse24 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse28 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse28 .cse12 .cse13 .cse15 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27) (and .cse0 .cse1 (< ~token~0 (+ 3 ~local~0)) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse12 .cse15 (<= (+ 2 ~local~0) ~token~0) .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse28 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27 .cse25)))) [2021-07-05 10:19:03,634 INFO L758 garLoopResultBuilder]: At program point L445-14(lines 386 390) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,634 INFO L762 garLoopResultBuilder]: For program point L445-15(lines 445 449) no Hoare annotation was computed. [2021-07-05 10:19:03,634 INFO L758 garLoopResultBuilder]: At program point L445-17(lines 478 482) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,635 INFO L758 garLoopResultBuilder]: At program point L182(lines 166 184) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~E_2~0 ~M_E~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~E_1~0 ~M_E~0)) (.cse4 (= ~T2_E~0 ~M_E~0)) (.cse5 (= ~t2_i~0 1)) (.cse6 (= ~E_M~0 ~M_E~0)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (= ~M_E~0 2)) (.cse12 (= ~t1_i~0 1)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 ~t2_pc~0) (<= ~local~0 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-07-05 10:19:03,635 INFO L758 garLoopResultBuilder]: At program point L182-1(lines 166 184) the Hoare annotation is: (let ((.cse6 (= ~t1_pc~0 1)) (.cse14 (= 0 ~t2_st~0))) (let ((.cse1 (<= ~token~0 ~local~0)) (.cse9 (not (= ~t1_st~0 0))) (.cse12 (<= ~local~0 ~token~0)) (.cse20 (= ~t2_pc~0 1)) (.cse21 (not .cse14)) (.cse22 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse23 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (not (= ~E_M~0 1))) (.cse24 (not .cse6)) (.cse25 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (not (= ~E_2~0 1))) (.cse11 (not (= ~m_st~0 0))) (.cse13 (not (= ~E_M~0 0))) (.cse15 (not (= ~T1_E~0 0))) (.cse16 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse17 (not (= ~T2_E~0 1))) (.cse18 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse26 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse19 (= ~t1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse19 .cse21) (and .cse22 .cse23 .cse0 .cse24 .cse25 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse26 .cse20 .cse19 .cse21) (and .cse22 .cse23 .cse0 .cse24 .cse25 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse26 .cse19)))) [2021-07-05 10:19:03,635 INFO L758 garLoopResultBuilder]: At program point L182-2(lines 166 184) the Hoare annotation is: (let ((.cse1 (not (= ~E_1~0 1))) (.cse8 (= ~m_pc~0 1)) (.cse9 (not (= ~t1_st~0 0))) (.cse17 (= 0 ~t2_st~0)) (.cse0 (not (= ~E_M~0 1))) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_M~0 0))) (.cse12 (not (= ~T1_E~0 0))) (.cse13 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse14 (not (= ~T2_E~0 1))) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse16 (= ~t1_i~0 1))) (or (let ((.cse5 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 (= ~t1_pc~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~t2_pc~0 1) .cse16 (not .cse17) (<= .cse5 ~token~0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (= 0 ~t2_pc~0) .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~m_pc~0 0)))) [2021-07-05 10:19:03,635 INFO L758 garLoopResultBuilder]: At program point L182-3(lines 166 184) the Hoare annotation is: (let ((.cse23 (= ~t1_pc~0 1))) (let ((.cse13 (= ~m_pc~0 0)) (.cse22 (not (= ~E_1~0 1))) (.cse24 (= ~m_pc~0 1)) (.cse14 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (not .cse23)) (.cse17 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse0 (not (= ~E_2~0 0))) (.cse1 (not (= ~T2_E~0 0))) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (not (= ~E_1~0 0))) (.cse4 (= ~t2_i~0 1)) (.cse18 (not (= ~t1_st~0 0))) (.cse5 (not (= ~E_2~0 1))) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ~E_M~0 0))) (.cse8 (not (= ~T1_E~0 0))) (.cse9 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (not (= ~T2_E~0 1))) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse20 (= ~t2_pc~0 1)) (.cse12 (= ~t1_i~0 1)) (.cse21 (not (= 0 ~t2_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse16 .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse20 .cse12 .cse21 .cse13) (and .cse22 (< ~token~0 (+ 3 ~local~0)) .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse24 .cse18 .cse5 .cse6 .cse7 (<= (+ 2 ~local~0) ~token~0) .cse8 .cse10 .cse20 .cse12 .cse21) (and .cse22 .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse21) (and .cse14 .cse15 .cse16 .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse20 .cse12 .cse21)))) [2021-07-05 10:19:03,635 INFO L758 garLoopResultBuilder]: At program point L182-4(lines 166 184) the Hoare annotation is: (let ((.cse25 (= ~t1_pc~0 1)) (.cse28 (= 0 ~t2_st~0))) (let ((.cse17 (not (= ~E_1~0 1))) (.cse20 (<= ~token~0 ~local~0)) (.cse29 (= ~m_pc~0 1)) (.cse7 (not (= ~m_st~0 0))) (.cse21 (<= ~local~0 ~token~0)) (.cse23 (= ~t2_pc~0 1)) (.cse24 (not .cse28)) (.cse15 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (not (= ~E_M~0 1))) (.cse18 (not .cse25)) (.cse19 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse1 (not (= ~E_2~0 0))) (.cse2 (not (= ~T2_E~0 0))) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (not (= ~E_1~0 0))) (.cse5 (= ~t2_i~0 1)) (.cse26 (= 0 ~t2_pc~0)) (.cse27 (not (= ~t1_st~0 0))) (.cse6 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (not (= ~T1_E~0 0))) (.cse10 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse11 (not (= ~T2_E~0 1))) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse22 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse13 (= ~t1_i~0 1)) (.cse14 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse0 .cse17 .cse18 .cse19 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse14) (and .cse0 .cse17 .cse20 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse26 .cse27 .cse6 .cse21 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse29 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse24) (and .cse0 .cse17 .cse20 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse29 .cse26 .cse6 .cse7 .cse21 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse16 .cse0 .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24) (and .cse0 .cse17 (< ~token~0 (+ 3 ~local~0)) .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse29 .cse27 .cse6 .cse8 (<= (+ 2 ~local~0) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse24) (and .cse15 .cse16 .cse0 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse14) (and .cse15 .cse16 .cse0 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse26 .cse27 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12 .cse22 .cse13) (and .cse15 .cse16 .cse0 .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse29 .cse26 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12 .cse22 .cse13) (and .cse15 .cse16 .cse0 .cse17 .cse18 .cse19 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse26 .cse6 .cse21 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12 .cse22 .cse13 .cse14) (and .cse15 .cse16 .cse0 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24) (and .cse0 .cse17 .cse20 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse27 .cse6 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse24 .cse14) (and .cse0 .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse29 .cse26 .cse27 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse30 (+ ~local~0 1))) (and .cse0 .cse17 .cse1 .cse2 .cse3 (<= ~token~0 .cse30) .cse4 .cse25 .cse5 .cse29 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 (<= .cse30 ~token~0))) (and .cse0 .cse17 .cse20 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse29 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse24) (and .cse15 .cse16 .cse0 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse26 .cse27 .cse6 .cse8 .cse28 .cse9 .cse10 .cse11 .cse12 .cse22 .cse13 .cse14)))) [2021-07-05 10:19:03,636 INFO L758 garLoopResultBuilder]: At program point L182-5(lines 166 184) the Hoare annotation is: (let ((.cse24 (= ~t1_pc~0 1)) (.cse28 (= 0 ~t2_st~0))) (let ((.cse6 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse22 (not .cse28)) (.cse3 (not (= ~E_1~0 1))) (.cse25 (= ~m_pc~0 1)) (.cse27 (not (= ~m_st~0 0))) (.cse20 (= ~t2_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse4 (not .cse24)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse7 (not (= ~E_2~0 0))) (.cse8 (not (= ~T2_E~0 0))) (.cse9 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse26 (= 0 ~t2_pc~0)) (.cse29 (not (= ~t1_st~0 0))) (.cse12 (not (= ~E_2~0 1))) (.cse14 (not (= ~E_M~0 0))) (.cse15 (not (= ~T1_E~0 0))) (.cse16 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse17 (not (= ~T2_E~0 1))) (.cse18 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse21 (= ~t1_i~0 1)) (.cse23 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse25 .cse26 .cse12 .cse27 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse26 .cse29 .cse12 .cse27 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse29 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse29 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse26 .cse29 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse29 .cse12 .cse27 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse2 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse25 .cse29 .cse12 .cse14 (<= (+ 2 ~local~0) ~token~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse26 .cse12 .cse27 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse25 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (let ((.cse30 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 (<= ~token~0 .cse30) .cse10 .cse24 .cse11 .cse25 .cse29 .cse12 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= .cse30 ~token~0))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse29 .cse12 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse23)))) [2021-07-05 10:19:03,636 INFO L762 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2021-07-05 10:19:03,636 INFO L762 garLoopResultBuilder]: For program point L386-1(lines 385 418) no Hoare annotation was computed. [2021-07-05 10:19:03,636 INFO L762 garLoopResultBuilder]: For program point L386-3(lines 385 418) no Hoare annotation was computed. [2021-07-05 10:19:03,636 INFO L762 garLoopResultBuilder]: For program point L189(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,636 INFO L762 garLoopResultBuilder]: For program point L189-2(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,636 INFO L762 garLoopResultBuilder]: For program point L189-3(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,636 INFO L762 garLoopResultBuilder]: For program point L189-5(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,637 INFO L762 garLoopResultBuilder]: For program point L189-6(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,637 INFO L762 garLoopResultBuilder]: For program point L189-8(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,637 INFO L762 garLoopResultBuilder]: For program point L189-9(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,637 INFO L762 garLoopResultBuilder]: For program point L189-11(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,637 INFO L762 garLoopResultBuilder]: For program point L189-12(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,637 INFO L762 garLoopResultBuilder]: For program point L189-14(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,637 INFO L762 garLoopResultBuilder]: For program point L189-15(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,637 INFO L762 garLoopResultBuilder]: For program point L189-17(lines 189 198) no Hoare annotation was computed. [2021-07-05 10:19:03,637 INFO L758 garLoopResultBuilder]: At program point L520(lines 512 522) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~E_2~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~E_1~0 ~M_E~0) (= ~T2_E~0 ~M_E~0) (= ~t2_i~0 1) (= ~E_M~0 ~M_E~0) (= 0 ~t2_pc~0) (<= ~local~0 ~token~0) (= 0 ~t2_st~0) (= ~t1_st~0 0) (= ~M_E~0 2) (= ~t1_i~0 1) (= ~m_pc~0 0)) [2021-07-05 10:19:03,637 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 10:19:03,638 INFO L762 garLoopResultBuilder]: For program point L190(lines 190 195) no Hoare annotation was computed. [2021-07-05 10:19:03,638 INFO L762 garLoopResultBuilder]: For program point L190-1(lines 190 195) no Hoare annotation was computed. [2021-07-05 10:19:03,638 INFO L762 garLoopResultBuilder]: For program point L190-2(lines 190 195) no Hoare annotation was computed. [2021-07-05 10:19:03,638 INFO L762 garLoopResultBuilder]: For program point L190-3(lines 190 195) no Hoare annotation was computed. [2021-07-05 10:19:03,638 INFO L762 garLoopResultBuilder]: For program point L190-4(lines 190 195) no Hoare annotation was computed. [2021-07-05 10:19:03,638 INFO L762 garLoopResultBuilder]: For program point L190-5(lines 190 195) no Hoare annotation was computed. [2021-07-05 10:19:03,638 INFO L758 garLoopResultBuilder]: At program point L323(lines 285 337) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse30 (= ~t1_pc~0 1))) (let ((.cse14 (= 0 ~t2_pc~0)) (.cse12 (= ~m_pc~0 1)) (.cse16 (not (= ~m_st~0 0))) (.cse3 (not (= ~E_1~0 1))) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse4 (not .cse30)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse23 (not (= ~t1_st~0 0))) (.cse15 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse26 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse27 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse31 (= ~t2_pc~0 1)) (.cse22 (= ~t1_i~0 1)) (.cse32 (not .cse18)) (.cse28 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse29 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse2 .cse6 .cse7 .cse8 .cse10 .cse11 .cse15 .cse16 .cse17 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse15 .cse16 .cse25 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse14 .cse23 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse23 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29)))) [2021-07-05 10:19:03,638 INFO L762 garLoopResultBuilder]: For program point L258(lines 258 273) no Hoare annotation was computed. [2021-07-05 10:19:03,639 INFO L762 garLoopResultBuilder]: For program point L258-1(lines 258 273) no Hoare annotation was computed. [2021-07-05 10:19:03,639 INFO L762 garLoopResultBuilder]: For program point L258-2(lines 258 273) no Hoare annotation was computed. [2021-07-05 10:19:03,639 INFO L762 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2021-07-05 10:19:03,639 INFO L762 garLoopResultBuilder]: For program point L391-1(lines 385 418) no Hoare annotation was computed. [2021-07-05 10:19:03,639 INFO L762 garLoopResultBuilder]: For program point L391-3(lines 385 418) no Hoare annotation was computed. [2021-07-05 10:19:03,639 INFO L762 garLoopResultBuilder]: For program point L326(lines 326 333) no Hoare annotation was computed. [2021-07-05 10:19:03,639 INFO L762 garLoopResultBuilder]: For program point L262(lines 262 272) no Hoare annotation was computed. [2021-07-05 10:19:03,639 INFO L762 garLoopResultBuilder]: For program point L262-1(lines 262 272) no Hoare annotation was computed. [2021-07-05 10:19:03,639 INFO L762 garLoopResultBuilder]: For program point L262-2(lines 262 272) no Hoare annotation was computed. [2021-07-05 10:19:03,639 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 10:19:03,640 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-07-05 10:19:03,640 INFO L762 garLoopResultBuilder]: For program point L396-1(lines 385 418) no Hoare annotation was computed. [2021-07-05 10:19:03,640 INFO L762 garLoopResultBuilder]: For program point L396-3(lines 385 418) no Hoare annotation was computed. [2021-07-05 10:19:03,640 INFO L758 garLoopResultBuilder]: At program point L595(lines 542 600) the Hoare annotation is: (= ~t1_i~0 1) [2021-07-05 10:19:03,640 INFO L762 garLoopResultBuilder]: For program point L266(lines 266 271) no Hoare annotation was computed. [2021-07-05 10:19:03,640 INFO L762 garLoopResultBuilder]: For program point L266-1(lines 266 271) no Hoare annotation was computed. [2021-07-05 10:19:03,640 INFO L758 garLoopResultBuilder]: At program point L200(lines 188 202) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= ~T1_E~0 ~M_E~0)) (.cse2 (= ~E_2~0 ~M_E~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~E_1~0 ~M_E~0)) (.cse5 (= ~T2_E~0 ~M_E~0)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~E_M~0 ~M_E~0)) (.cse8 (= 0 ~t2_st~0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse11 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (= ~M_E~0 2)) (.cse13 (= ~t1_i~0 1)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_st~0 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 (<= ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~t2_pc~0) (<= ~local~0 ~token~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2021-07-05 10:19:03,640 INFO L762 garLoopResultBuilder]: For program point L266-2(lines 266 271) no Hoare annotation was computed. [2021-07-05 10:19:03,640 INFO L758 garLoopResultBuilder]: At program point L200-1(lines 188 202) the Hoare annotation is: (let ((.cse12 (= 0 ~t2_st~0)) (.cse19 (= ~t1_pc~0 1))) (let ((.cse8 (= 0 ~t2_pc~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse2 (not .cse19)) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (not (= ~E_M~0 1))) (.cse16 (not (= ~E_1~0 1))) (.cse3 (not (= ~E_2~0 0))) (.cse4 (not (= ~T2_E~0 0))) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse17 (not (= ~t1_st~0 0))) (.cse9 (not (= ~E_2~0 1))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_M~0 0))) (.cse13 (not (= ~T1_E~0 0))) (.cse14 (not (= ~T2_E~0 1))) (.cse21 (= ~t2_pc~0 1)) (.cse15 (= ~t1_i~0 1)) (.cse22 (not .cse12))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse17 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse18 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse17 .cse9 .cse10 .cse20 .cse11 .cse13 .cse14 .cse21 .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse21 .cse15 .cse22) (and .cse0 .cse1 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse13 .cse14 .cse21 .cse15 .cse22)))) [2021-07-05 10:19:03,641 INFO L758 garLoopResultBuilder]: At program point L200-2(lines 188 202) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (not (= ~E_M~0 1))) (.cse2 (not (= ~E_1~0 1))) (.cse3 (not (= ~E_2~0 0))) (.cse4 (not (= ~T2_E~0 0))) (.cse5 (not (= ~T1_E~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0))) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~E_M~0 0))) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~T1_E~0 0))) (.cse14 (not (= ~T2_E~0 1))) (.cse15 (= ~t1_i~0 1))) (or (let ((.cse6 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 .cse6) .cse7 (= ~t1_pc~0 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~t2_pc~0 1) .cse15 (not .cse16) (<= .cse6 ~token~0))) (and .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse12 .cse13 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse15 (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ~m_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 (= 0 ~t2_pc~0) .cse10 .cse11 .cse12 .cse16 .cse13 .cse14 .cse15))) [2021-07-05 10:19:03,641 INFO L762 garLoopResultBuilder]: For program point L134(lines 134 142) no Hoare annotation was computed. [2021-07-05 10:19:03,641 INFO L758 garLoopResultBuilder]: At program point L200-3(lines 188 202) the Hoare annotation is: (let ((.cse22 (= ~t1_pc~0 1))) (let ((.cse11 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse17 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse18 (= ~m_pc~0 0)) (.cse19 (not (= ~E_1~0 1))) (.cse20 (= ~m_pc~0 1)) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (not .cse22)) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~t2_i~0 1)) (.cse7 (not (= ~t1_st~0 0))) (.cse8 (not (= ~E_2~0 1))) (.cse21 (not (= ~m_st~0 0))) (.cse9 (not (= ~E_M~0 0))) (.cse10 (not (= ~T1_E~0 0))) (.cse12 (not (= ~T2_E~0 1))) (.cse14 (= ~t2_pc~0 1)) (.cse15 (= ~t1_i~0 1)) (.cse16 (not (= 0 ~t2_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse21 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse18) (and .cse0 .cse19 (< ~token~0 (+ 3 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse22 .cse6 .cse20 .cse7 .cse8 .cse9 (<= (+ 2 ~local~0) ~token~0) .cse10 .cse12 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16)))) [2021-07-05 10:19:03,641 INFO L758 garLoopResultBuilder]: At program point L200-4(lines 188 202) the Hoare annotation is: (let ((.cse15 (= 0 ~t2_st~0)) (.cse24 (= ~t1_pc~0 1))) (let ((.cse3 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse10 (= 0 ~t2_pc~0)) (.cse27 (not .cse24)) (.cse20 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse21 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse26 (not .cse15)) (.cse22 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse23 (= ~m_pc~0 0)) (.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (not (= ~E_M~0 1))) (.cse2 (not (= ~E_1~0 1))) (.cse4 (not (= ~E_2~0 0))) (.cse5 (not (= ~T2_E~0 0))) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~m_pc~0 1)) (.cse19 (not (= ~t1_st~0 0))) (.cse11 (not (= ~E_2~0 1))) (.cse12 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_M~0 0))) (.cse16 (not (= ~T1_E~0 0))) (.cse17 (not (= ~T2_E~0 1))) (.cse25 (= ~t2_pc~0 1)) (.cse18 (= ~t1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse19 .cse11 .cse13 .cse14 .cse15 .cse16 .cse20 .cse17 .cse21 .cse18 .cse22 .cse23) (and .cse0 .cse1 .cse2 (< ~token~0 (+ 3 ~local~0)) .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse19 .cse11 .cse14 (<= (+ 2 ~local~0) ~token~0) .cse16 .cse17 .cse25 .cse18 .cse26) (and .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse16 .cse20 .cse17 .cse21 .cse18 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse11 .cse12 .cse14 .cse16 .cse17 .cse25 .cse18 .cse26) (and .cse0 .cse1 .cse2 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse16 .cse17 .cse25 .cse18 .cse26) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse13 .cse14 .cse16 .cse20 .cse17 .cse21 .cse25 .cse18 .cse26 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse11 .cse13 .cse14 .cse16 .cse20 .cse17 .cse21 .cse25 .cse18 .cse26 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse25 .cse18 .cse26) (and .cse0 .cse1 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse19 .cse11 .cse14 .cse15 .cse16 .cse20 .cse17 .cse21 .cse18 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse20 .cse17 .cse21 .cse18 .cse22 .cse23) (and .cse0 .cse1 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse11 .cse12 .cse14 .cse16 .cse17 .cse25 .cse18 .cse26) (and .cse0 .cse1 .cse2 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse19 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse11 .cse14 .cse16 .cse20 .cse17 .cse21 .cse25 .cse18 .cse26 .cse22 .cse23) (let ((.cse28 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~token~0 .cse28) .cse7 .cse24 .cse8 .cse9 .cse19 .cse11 .cse12 .cse14 .cse16 .cse17 .cse25 .cse18 (<= .cse28 ~token~0)))))) [2021-07-05 10:19:03,641 INFO L758 garLoopResultBuilder]: At program point L200-5(lines 188 202) the Hoare annotation is: (let ((.cse23 (= 0 ~t2_st~0)) (.cse24 (= ~t1_pc~0 1))) (let ((.cse21 (= 0 ~t2_pc~0)) (.cse20 (= ~m_pc~0 1)) (.cse22 (not (= ~t1_st~0 0))) (.cse8 (not (= ~m_st~0 0))) (.cse18 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (not (= ~E_M~0 1))) (.cse19 (not (= ~E_1~0 1))) (.cse27 (not .cse24)) (.cse1 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse28 (<= ~token~0 ~local~0)) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~t2_i~0 1)) (.cse7 (not (= ~E_2~0 1))) (.cse29 (<= ~local~0 ~token~0)) (.cse9 (not (= ~E_M~0 0))) (.cse10 (not (= ~T1_E~0 0))) (.cse11 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse12 (not (= ~T2_E~0 1))) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse25 (= ~t2_pc~0 1)) (.cse15 (= ~t1_i~0 1)) (.cse26 (not .cse23)) (.cse16 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse17 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse22 .cse7 .cse8 .cse9 .cse23 .cse10 .cse12 .cse14 .cse15) (and .cse18 .cse0 .cse19 (< ~token~0 (+ 3 ~local~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse7 .cse9 (<= (+ 2 ~local~0) ~token~0) .cse10 .cse12 .cse14 .cse25 .cse15 .cse26) (and .cse18 .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse26 .cse16 .cse17) (and .cse18 .cse0 .cse19 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse8 .cse9 .cse23 .cse10 .cse12 .cse14 .cse15) (and .cse18 .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse25 .cse15 .cse26) (and .cse18 .cse0 .cse19 .cse1 .cse28 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse29 .cse9 .cse10 .cse12 .cse14 .cse25 .cse15 .cse26) (and .cse18 .cse0 .cse19 .cse1 .cse28 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse26 .cse16 .cse17) (and .cse18 .cse0 .cse19 .cse1 .cse28 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse7 .cse29 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse19 .cse1 .cse28 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse8 .cse29 .cse9 .cse23 .cse10 .cse12 .cse14 .cse15) (and .cse18 .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse7 .cse8 .cse9 .cse23 .cse10 .cse12 .cse14 .cse15) (and .cse18 .cse0 .cse19 .cse27 .cse1 .cse28 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse29 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse22 .cse7 .cse9 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse30 (+ ~local~0 1))) (and .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse30) .cse5 .cse24 .cse6 .cse20 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse25 .cse15 (<= .cse30 ~token~0))) (and .cse18 .cse0 .cse19 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse25 .cse15 .cse26) (and .cse18 .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse25 .cse15 .cse26) (and .cse18 .cse0 .cse19 .cse27 .cse1 .cse28 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse26 .cse16 .cse17)))) [2021-07-05 10:19:03,642 INFO L762 garLoopResultBuilder]: For program point L531(lines 531 536) no Hoare annotation was computed. [2021-07-05 10:19:03,642 INFO L758 garLoopResultBuilder]: At program point L201(lines 185 203) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ~E_2~0 ~M_E~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~E_1~0 ~M_E~0)) (.cse6 (= ~T2_E~0 ~M_E~0)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~E_M~0 ~M_E~0)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse13 (= ~M_E~0 2)) (.cse14 (= ~t1_i~0 1)) (.cse15 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse16 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ~m_st~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_pc~0) (<= ~local~0 ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-07-05 10:19:03,642 INFO L758 garLoopResultBuilder]: At program point L201-1(lines 185 203) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse20 (= ~t1_pc~0 1))) (let ((.cse3 (not .cse20)) (.cse19 (<= ~token~0 ~local~0)) (.cse22 (<= ~local~0 ~token~0)) (.cse17 (= 0 ~t2_pc~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse23 (not (= ~E_1~0 1))) (.cse4 (not (= ~E_2~0 0))) (.cse5 (not (= ~T2_E~0 0))) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse21 (not (= ~t1_st~0 0))) (.cse9 (not (= ~E_2~0 1))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_M~0 0))) (.cse12 (not (= ~T1_E~0 0))) (.cse13 (not (= ~T2_E~0 1))) (.cse14 (= ~t2_pc~0 1)) (.cse15 (= ~t1_i~0 1)) (.cse16 (not .cse18))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse15) (and .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse17 .cse21 .cse9 .cse10 .cse22 .cse11 .cse18 .cse12 .cse13 .cse15) (and .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse21 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)))) [2021-07-05 10:19:03,642 INFO L758 garLoopResultBuilder]: At program point L201-2(lines 185 203) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (not (= ~E_1~0 1))) (.cse4 (not (= ~E_2~0 0))) (.cse5 (not (= ~T2_E~0 0))) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~m_pc~0 1)) (.cse10 (not (= ~t1_st~0 0))) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~E_M~0 0))) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (not (= ~T2_E~0 1))) (.cse16 (= ~t1_i~0 1)) (.cse13 (= 0 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~t2_pc~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse16 (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ~m_pc~0 0)) (let ((.cse17 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 .cse17) .cse7 (= ~t1_pc~0 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 (= ~t2_pc~0 1) .cse16 (not .cse13) (<= .cse17 ~token~0))))) [2021-07-05 10:19:03,642 INFO L758 garLoopResultBuilder]: At program point L201-3(lines 185 203) the Hoare annotation is: (let ((.cse18 (= ~t1_pc~0 1))) (let ((.cse2 (not (= ~E_1~0 1))) (.cse8 (= ~m_pc~0 1)) (.cse11 (not (= ~m_st~0 0))) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse23 (not .cse18)) (.cse3 (not (= ~E_2~0 0))) (.cse4 (not (= ~T2_E~0 0))) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse9 (not (= ~t1_st~0 0))) (.cse10 (not (= ~E_2~0 1))) (.cse12 (not (= ~E_M~0 0))) (.cse13 (not (= ~T1_E~0 0))) (.cse19 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse14 (not (= ~T2_E~0 1))) (.cse20 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= ~t2_pc~0 1)) (.cse16 (= ~t1_i~0 1)) (.cse17 (not (= 0 ~t2_st~0))) (.cse21 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse22 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 (< ~token~0 (+ 3 ~local~0)) .cse3 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 (<= (+ 2 ~local~0) ~token~0) .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse19 .cse14 .cse20 .cse16 .cse21 .cse22) (and .cse0 .cse1 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse23 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse19 .cse14 .cse20 .cse15 .cse16 .cse17 .cse21 .cse22)))) [2021-07-05 10:19:03,642 INFO L758 garLoopResultBuilder]: At program point L201-4(lines 185 203) the Hoare annotation is: (let ((.cse28 (= ~t1_pc~0 1)) (.cse27 (= 0 ~t2_st~0))) (let ((.cse24 (= ~m_pc~0 1)) (.cse25 (not (= ~m_st~0 0))) (.cse18 (= ~t2_pc~0 1)) (.cse20 (not .cse27)) (.cse23 (not .cse28)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse3 (not (= ~E_1~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (not (= ~E_2~0 0))) (.cse6 (not (= ~T2_E~0 0))) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse26 (= 0 ~t2_pc~0)) (.cse10 (not (= ~t1_st~0 0))) (.cse11 (not (= ~E_2~0 1))) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (not (= ~E_M~0 0))) (.cse14 (not (= ~T1_E~0 0))) (.cse15 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse16 (not (= ~T2_E~0 1))) (.cse17 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (= ~t1_i~0 1)) (.cse21 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse22 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse11 .cse25 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse25 .cse13 .cse27 .cse14 .cse16 .cse19) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse26 .cse10 .cse11 .cse25 .cse13 .cse27 .cse14 .cse16 .cse19) (and .cse0 .cse1 .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse28 .cse9 .cse24 .cse10 .cse11 .cse13 (<= (+ 2 ~local~0) ~token~0) .cse14 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse26 .cse11 .cse25 .cse12 .cse13 .cse27 .cse14 .cse16 .cse19) (let ((.cse29 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (<= ~token~0 .cse29) .cse8 .cse28 .cse9 .cse24 .cse10 .cse11 .cse25 .cse13 .cse14 .cse16 .cse18 .cse19 (<= .cse29 ~token~0))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse25 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse26 .cse11 .cse25 .cse13 .cse27 .cse14 .cse16 .cse19) (and .cse0 .cse1 .cse2 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse11 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse11 .cse25 .cse12 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22)))) [2021-07-05 10:19:03,643 INFO L758 garLoopResultBuilder]: At program point L201-5(lines 185 203) the Hoare annotation is: (let ((.cse28 (= 0 ~t2_st~0)) (.cse30 (= ~t1_pc~0 1))) (let ((.cse21 (<= ~token~0 ~local~0)) (.cse27 (= 0 ~t2_pc~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse20 (not (= ~E_1~0 1))) (.cse29 (= ~m_pc~0 1)) (.cse8 (not (= ~m_st~0 0))) (.cse18 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse19 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (not (= ~E_M~0 1))) (.cse26 (not .cse30)) (.cse1 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~t2_i~0 1)) (.cse22 (not (= ~t1_st~0 0))) (.cse7 (not (= ~E_2~0 1))) (.cse9 (not (= ~E_M~0 0))) (.cse10 (not (= ~T1_E~0 0))) (.cse11 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse12 (not (= ~T2_E~0 1))) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse24 (= ~t2_pc~0 1)) (.cse15 (= ~t1_i~0 1)) (.cse25 (not .cse28)) (.cse16 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse17 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse15 .cse25 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse24 .cse15 .cse25) (and .cse18 .cse19 .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse22 .cse7 .cse8 .cse9 .cse28 .cse10 .cse12 .cse14 .cse15) (and .cse18 .cse19 .cse0 .cse20 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse24 .cse15 .cse25) (and .cse18 .cse19 .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse22 .cse7 .cse23 .cse9 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse20 .cse26 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse23 .cse9 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse7 .cse8 .cse23 .cse9 .cse10 .cse12 .cse14 .cse24 .cse15 .cse25) (and .cse18 .cse19 .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse27 .cse22 .cse7 .cse8 .cse9 .cse28 .cse10 .cse12 .cse14 .cse15) (and .cse18 .cse19 .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse24 .cse15 .cse25) (and .cse18 .cse19 .cse0 .cse20 .cse26 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse15 .cse25 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse20 (< ~token~0 (+ 3 ~local~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse29 .cse22 .cse7 .cse9 (<= (+ 2 ~local~0) ~token~0) .cse10 .cse12 .cse14 .cse24 .cse15 .cse25) (and .cse18 .cse19 .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse27 .cse22 .cse7 .cse9 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse20 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse27 .cse7 .cse8 .cse9 .cse28 .cse10 .cse12 .cse14 .cse15) (and .cse18 .cse19 .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse29 .cse27 .cse7 .cse8 .cse23 .cse9 .cse28 .cse10 .cse12 .cse14 .cse15) (let ((.cse31 (+ ~local~0 1))) (and .cse18 .cse19 .cse0 .cse20 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse31) .cse5 .cse30 .cse6 .cse29 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse24 .cse15 (<= .cse31 ~token~0))) (and .cse18 .cse19 .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse15 .cse25 .cse16 .cse17)))) [2021-07-05 10:19:03,643 INFO L762 garLoopResultBuilder]: For program point L401-1(lines 385 418) no Hoare annotation was computed. [2021-07-05 10:19:03,643 INFO L762 garLoopResultBuilder]: For program point L401-3(lines 385 418) no Hoare annotation was computed. [2021-07-05 10:19:03,643 INFO L762 garLoopResultBuilder]: For program point L137(lines 137 141) no Hoare annotation was computed. [2021-07-05 10:19:03,643 INFO L758 garLoopResultBuilder]: At program point L138(lines 133 164) the Hoare annotation is: (let ((.cse7 (not (= ~m_st~0 0))) (.cse0 (not (= ~E_M~0 1))) (.cse17 (= ~t1_pc~0 1)) (.cse1 (not (= ~E_2~0 0))) (.cse2 (not (= ~T2_E~0 0))) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (not (= ~E_1~0 0))) (.cse5 (= ~t2_i~0 1)) (.cse18 (not (= ~t1_st~0 0))) (.cse6 (not (= ~E_2~0 1))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (not (= ~T1_E~0 0))) (.cse10 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse11 (not (= ~T2_E~0 1))) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (= ~t2_pc~0 1)) (.cse13 (= ~t1_i~0 1)) (.cse20 (not (= 0 ~t2_st~0))) (.cse14 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ ~local~0 1))) (and .cse0 (not (= ~E_1~0 1)) .cse1 .cse2 .cse3 (<= ~token~0 .cse16) .cse4 .cse17 .cse5 (= ~m_pc~0 1) .cse18 .cse6 .cse7 .cse8 .cse9 .cse11 .cse19 .cse13 .cse20 (<= .cse16 ~token~0))) (and (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse0 (not .cse17) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0) .cse1 .cse2 .cse3 (= ULTIMATE.start_activate_threads_~tmp___0~0 0) .cse4 .cse5 (= ULTIMATE.start_activate_threads_~tmp___1~0 0) .cse18 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0) .cse19 .cse13 .cse20 .cse14 .cse15))) [2021-07-05 10:19:03,643 INFO L762 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2021-07-05 10:19:03,643 INFO L762 garLoopResultBuilder]: For program point L72-1(lines 71 85) no Hoare annotation was computed. [2021-07-05 10:19:03,644 INFO L762 garLoopResultBuilder]: For program point L73(lines 73 75) no Hoare annotation was computed. [2021-07-05 10:19:03,644 INFO L758 garLoopResultBuilder]: At program point L338(lines 279 343) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse30 (= ~t1_pc~0 1))) (let ((.cse14 (= 0 ~t2_pc~0)) (.cse12 (= ~m_pc~0 1)) (.cse16 (not (= ~m_st~0 0))) (.cse3 (not (= ~E_1~0 1))) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse4 (not .cse30)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse23 (not (= ~t1_st~0 0))) (.cse15 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse26 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse27 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse31 (= ~t2_pc~0 1)) (.cse22 (= ~t1_i~0 1)) (.cse32 (not .cse18)) (.cse28 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse29 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse2 .cse6 .cse7 .cse8 .cse10 .cse11 .cse15 .cse16 .cse17 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse15 .cse16 .cse25 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse14 .cse23 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse23 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29)))) [2021-07-05 10:19:03,644 INFO L758 garLoopResultBuilder]: At program point L471(lines 465 473) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,644 INFO L758 garLoopResultBuilder]: At program point L538(lines 527 540) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,644 INFO L762 garLoopResultBuilder]: For program point L406-1(lines 385 418) no Hoare annotation was computed. [2021-07-05 10:19:03,645 INFO L762 garLoopResultBuilder]: For program point L406-3(lines 385 418) no Hoare annotation was computed. [2021-07-05 10:19:03,645 INFO L762 garLoopResultBuilder]: For program point L208(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,645 INFO L762 garLoopResultBuilder]: For program point L208-2(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,645 INFO L762 garLoopResultBuilder]: For program point L208-3(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,645 INFO L762 garLoopResultBuilder]: For program point L208-5(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,645 INFO L762 garLoopResultBuilder]: For program point L208-6(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,645 INFO L762 garLoopResultBuilder]: For program point L208-8(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,645 INFO L762 garLoopResultBuilder]: For program point L208-9(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,645 INFO L762 garLoopResultBuilder]: For program point L208-11(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,645 INFO L762 garLoopResultBuilder]: For program point L208-12(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,645 INFO L762 garLoopResultBuilder]: For program point L208-14(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,646 INFO L762 garLoopResultBuilder]: For program point L208-15(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,646 INFO L762 garLoopResultBuilder]: For program point L208-17(lines 208 217) no Hoare annotation was computed. [2021-07-05 10:19:03,646 INFO L758 garLoopResultBuilder]: At program point L539(lines 523 541) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,646 INFO L758 garLoopResultBuilder]: At program point L275(lines 257 277) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse30 (= ~t1_pc~0 1))) (let ((.cse14 (= 0 ~t2_pc~0)) (.cse12 (= ~m_pc~0 1)) (.cse16 (not (= ~m_st~0 0))) (.cse3 (not (= ~E_1~0 1))) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse4 (not .cse30)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse23 (not (= ~t1_st~0 0))) (.cse15 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse26 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse27 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse31 (= ~t2_pc~0 1)) (.cse22 (= ~t1_i~0 1)) (.cse32 (not .cse18)) (.cse28 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse29 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse2 .cse6 .cse7 .cse8 .cse10 .cse11 .cse15 .cse16 .cse17 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse15 .cse16 .cse25 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse14 .cse23 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse23 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29)))) [2021-07-05 10:19:03,646 INFO L758 garLoopResultBuilder]: At program point L275-1(lines 257 277) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,647 INFO L762 garLoopResultBuilder]: For program point L209(lines 209 214) no Hoare annotation was computed. [2021-07-05 10:19:03,647 INFO L758 garLoopResultBuilder]: At program point L275-2(lines 257 277) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,647 INFO L762 garLoopResultBuilder]: For program point L209-1(lines 209 214) no Hoare annotation was computed. [2021-07-05 10:19:03,647 INFO L762 garLoopResultBuilder]: For program point L209-2(lines 209 214) no Hoare annotation was computed. [2021-07-05 10:19:03,647 INFO L762 garLoopResultBuilder]: For program point L209-3(lines 209 214) no Hoare annotation was computed. [2021-07-05 10:19:03,647 INFO L762 garLoopResultBuilder]: For program point L209-4(lines 209 214) no Hoare annotation was computed. [2021-07-05 10:19:03,647 INFO L762 garLoopResultBuilder]: For program point L209-5(lines 209 214) no Hoare annotation was computed. [2021-07-05 10:19:03,648 INFO L758 garLoopResultBuilder]: At program point L276(lines 254 278) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse30 (= ~t1_pc~0 1))) (let ((.cse14 (= 0 ~t2_pc~0)) (.cse12 (= ~m_pc~0 1)) (.cse16 (not (= ~m_st~0 0))) (.cse3 (not (= ~E_1~0 1))) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse4 (not .cse30)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse23 (not (= ~t1_st~0 0))) (.cse15 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse26 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse27 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse31 (= ~t2_pc~0 1)) (.cse22 (= ~t1_i~0 1)) (.cse32 (not .cse18)) (.cse28 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse29 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse2 .cse6 .cse7 .cse8 .cse10 .cse11 .cse15 .cse16 .cse17 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse15 .cse16 .cse25 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse14 .cse23 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse23 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29)))) [2021-07-05 10:19:03,648 INFO L758 garLoopResultBuilder]: At program point L276-1(lines 254 278) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,648 INFO L758 garLoopResultBuilder]: At program point L276-2(lines 254 278) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,648 INFO L758 garLoopResultBuilder]: At program point L78(lines 41 92) the Hoare annotation is: (let ((.cse6 (= ~t1_pc~0 1)) (.cse27 (= 0 ~t2_st~0))) (let ((.cse24 (<= ~token~0 ~local~0)) (.cse8 (not (= ~t1_st~0 0))) (.cse26 (<= ~local~0 ~token~0)) (.cse14 (= ~t2_pc~0 1)) (.cse16 (not .cse27)) (.cse17 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse18 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 1))) (.cse19 (not .cse6)) (.cse20 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse21 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse5 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse22 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse25 (= 0 ~t2_pc~0)) (.cse9 (not (= ~E_2~0 1))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_M~0 0))) (.cse12 (not (= ~T1_E~0 0))) (.cse13 (not (= ~T2_E~0 1))) (.cse23 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse15 (= ~t1_i~0 1)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 (< ~token~0 (+ 3 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 1) .cse8 .cse9 .cse10 .cse11 (<= (+ 2 ~local~0) ~token~0) .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse18 .cse0 .cse19 .cse20 .cse2 .cse3 .cse4 .cse21 .cse5 .cse7 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse26 .cse11 .cse27 .cse12 .cse13 .cse15 .cse28) (and .cse17 .cse18 .cse0 .cse19 .cse20 .cse2 .cse3 .cse4 .cse21 .cse5 .cse7 .cse22 .cse25 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse23 .cse15 .cse28) (and .cse0 .cse1 .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28) (and .cse17 .cse18 .cse0 .cse1 .cse19 .cse20 .cse2 .cse3 .cse4 .cse21 .cse5 .cse7 .cse22 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse15 .cse16 .cse28) (and .cse17 .cse18 .cse0 .cse1 .cse19 .cse20 .cse2 .cse3 .cse4 .cse21 .cse5 .cse7 .cse22 .cse25 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse23 .cse15 .cse28)))) [2021-07-05 10:19:03,649 INFO L762 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-07-05 10:19:03,649 INFO L762 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-07-05 10:19:03,649 INFO L758 garLoopResultBuilder]: At program point L145-1(lines 133 164) the Hoare annotation is: (let ((.cse7 (= ~t1_pc~0 1))) (let ((.cse2 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse1 (not (= ~E_1~0 1))) (.cse9 (= ~m_pc~0 1)) (.cse11 (not (= ~m_st~0 0))) (.cse19 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse20 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (not (= ~E_M~0 1))) (.cse21 (not .cse7)) (.cse22 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse3 (not (= ~E_2~0 0))) (.cse4 (not (= ~T2_E~0 0))) (.cse5 (not (= ~T1_E~0 1))) (.cse23 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse6 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse24 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse18 (not (= ~t1_st~0 0))) (.cse10 (not (= ~E_2~0 1))) (.cse13 (not (= ~E_M~0 0))) (.cse14 (not (= ~T1_E~0 0))) (.cse26 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse15 (not (= ~T2_E~0 1))) (.cse27 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse25 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse16 (= ~t1_i~0 1)) (.cse17 (not (= 0 ~t2_st~0))) (.cse28 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse29 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse19 .cse20 .cse0 .cse21 .cse22 .cse3 .cse4 .cse5 .cse23 .cse6 .cse8 .cse24 .cse18 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17) (and .cse19 .cse20 .cse0 .cse1 .cse21 .cse22 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse8 .cse24 .cse10 .cse12 .cse13 .cse14 .cse26 .cse15 .cse27 .cse25 .cse16 .cse17 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse10 .cse12 .cse13 .cse14 .cse26 .cse15 .cse27 .cse16 .cse17 .cse28 .cse29) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse13 .cse14 .cse26 .cse15 .cse27 .cse16 .cse28 .cse29) (and .cse0 .cse1 (< ~token~0 (+ 3 ~local~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse13 (<= (+ 2 ~local~0) ~token~0) .cse14 .cse15 (= ~t2_pc~0 1) .cse16 .cse17) (and .cse19 .cse20 .cse0 .cse1 .cse21 .cse22 .cse3 .cse4 .cse5 .cse23 .cse6 .cse8 .cse9 .cse24 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17) (and .cse19 .cse20 .cse0 .cse21 .cse22 .cse3 .cse4 .cse5 .cse23 .cse6 .cse8 .cse24 .cse18 .cse10 .cse13 .cse14 .cse26 .cse15 .cse27 .cse25 .cse16 .cse17 .cse28 .cse29)))) [2021-07-05 10:19:03,649 INFO L762 garLoopResultBuilder]: For program point L79(lines 79 83) no Hoare annotation was computed. [2021-07-05 10:19:03,649 INFO L762 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2021-07-05 10:19:03,649 INFO L762 garLoopResultBuilder]: For program point L80(lines 80 82) no Hoare annotation was computed. [2021-07-05 10:19:03,649 INFO L758 garLoopResultBuilder]: At program point L411-3(lines 382 419) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,649 INFO L758 garLoopResultBuilder]: At program point L610(lines 601 612) the Hoare annotation is: (= ~t1_i~0 1) [2021-07-05 10:19:03,650 INFO L762 garLoopResultBuilder]: For program point L478-1(lines 477 510) no Hoare annotation was computed. [2021-07-05 10:19:03,650 INFO L762 garLoopResultBuilder]: For program point L348-1(lines 347 380) no Hoare annotation was computed. [2021-07-05 10:19:03,650 INFO L762 garLoopResultBuilder]: For program point L348-2(lines 348 352) no Hoare annotation was computed. [2021-07-05 10:19:03,650 INFO L762 garLoopResultBuilder]: For program point L348-4(lines 347 380) no Hoare annotation was computed. [2021-07-05 10:19:03,650 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 10:19:03,650 INFO L762 garLoopResultBuilder]: For program point L483-1(lines 477 510) no Hoare annotation was computed. [2021-07-05 10:19:03,650 INFO L758 garLoopResultBuilder]: At program point L219(lines 207 221) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= ~E_2~0 ~M_E~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~E_1~0 ~M_E~0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse8 (= ~T2_E~0 ~M_E~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (= ~t1_st~0 0)) (.cse13 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= ~M_E~0 2)) (.cse16 (= ~t1_i~0 1)) (.cse17 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse18 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ~t2_pc~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~m_st~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-07-05 10:19:03,650 INFO L758 garLoopResultBuilder]: At program point L219-1(lines 207 221) the Hoare annotation is: (let ((.cse15 (= 0 ~t2_st~0)) (.cse20 (= ~t1_pc~0 1))) (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (not .cse20)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse19 (<= ~token~0 ~local~0)) (.cse11 (= 0 ~t2_pc~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse4 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse5 (not (= ~E_2~0 0))) (.cse6 (not (= ~T2_E~0 0))) (.cse7 (not (= ~T1_E~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (= ~t2_i~0 1)) (.cse24 (not (= ~t1_st~0 0))) (.cse12 (not (= ~E_2~0 1))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_M~0 0))) (.cse16 (not (= ~T1_E~0 0))) (.cse17 (not (= ~T2_E~0 1))) (.cse22 (= ~t2_pc~0 1)) (.cse18 (= ~t1_i~0 1)) (.cse23 (not .cse15))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse2 .cse4 .cse19 .cse5 .cse6 .cse7 .cse9 .cse20 .cse10 .cse12 .cse13 .cse21 .cse14 .cse16 .cse17 .cse22 .cse18 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22 .cse18 .cse23) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse2 .cse4 .cse19 .cse5 .cse6 .cse7 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse21 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse24 .cse12 .cse13 .cse14 .cse16 .cse17 .cse22 .cse18 .cse23)))) [2021-07-05 10:19:03,651 INFO L758 garLoopResultBuilder]: At program point L219-2(lines 207 221) the Hoare annotation is: (let ((.cse17 (= 0 ~t2_st~0))) (let ((.cse13 (= ~t2_pc~0 1)) (.cse15 (not .cse17)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 1))) (.cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse3 (not (= ~E_2~0 0))) (.cse4 (not (= ~T2_E~0 0))) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~m_pc~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ~E_M~0 0))) (.cse11 (not (= ~T1_E~0 0))) (.cse12 (not (= ~T2_E~0 1))) (.cse14 (= ~t1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (let ((.cse16 (+ ~local~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= ~token~0 .cse16) .cse6 (= ~t1_pc~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= .cse16 ~token~0))) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse14 (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ~m_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_pc~0) .cse9 .cse10 .cse17 .cse11 .cse12 .cse14)))) [2021-07-05 10:19:03,651 INFO L758 garLoopResultBuilder]: At program point L219-3(lines 207 221) the Hoare annotation is: (let ((.cse25 (= ~t1_pc~0 1))) (let ((.cse10 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (= ~m_pc~0 0)) (.cse23 (not (= ~E_1~0 1))) (.cse24 (= ~m_pc~0 1)) (.cse16 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (not .cse25)) (.cse0 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse1 (not (= ~E_2~0 0))) (.cse2 (not (= ~T2_E~0 0))) (.cse3 (not (= ~T1_E~0 1))) (.cse19 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse4 (not (= ~E_1~0 0))) (.cse5 (= ~t2_i~0 1)) (.cse20 (not (= ~t1_st~0 0))) (.cse6 (not (= ~E_2~0 1))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (not (= ~T1_E~0 0))) (.cse11 (not (= ~T2_E~0 1))) (.cse21 (= ~t2_pc~0 1)) (.cse13 (= ~t1_i~0 1)) (.cse22 (not (= 0 ~t2_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse20 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse22 .cse14 .cse15) (and .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse21 .cse13 .cse22) (and .cse23 (< ~token~0 (+ 3 ~local~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse24 .cse20 .cse6 .cse8 (<= (+ 2 ~local~0) ~token~0) .cse9 .cse11 .cse21 .cse13 .cse22) (and .cse16 .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse11 .cse21 .cse13 .cse22)))) [2021-07-05 10:19:03,651 INFO L758 garLoopResultBuilder]: At program point L219-4(lines 207 221) the Hoare annotation is: (let ((.cse15 (= 0 ~t2_st~0)) (.cse8 (= ~t1_pc~0 1))) (let ((.cse17 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse19 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse22 (= ~m_pc~0 0)) (.cse27 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse28 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse29 (not .cse8)) (.cse30 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse26 (not .cse15)) (.cse3 (<= ~token~0 ~local~0)) (.cse10 (= 0 ~t2_pc~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 1))) (.cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (not (= ~E_2~0 0))) (.cse5 (not (= ~T2_E~0 0))) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse23 (= ~m_pc~0 1)) (.cse11 (not (= ~t1_st~0 0))) (.cse12 (not (= ~E_2~0 1))) (.cse24 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_M~0 0))) (.cse16 (not (= ~T1_E~0 0))) (.cse18 (not (= ~T2_E~0 1))) (.cse25 (= ~t2_pc~0 1)) (.cse20 (= ~t1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse12 .cse24 .cse13 .cse14 .cse16 .cse18 .cse25 .cse20 .cse26) (and .cse0 .cse1 (< ~token~0 (+ 3 ~local~0)) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse11 .cse12 .cse14 (<= (+ 2 ~local~0) ~token~0) .cse16 .cse18 .cse25 .cse20 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse12 .cse24 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse27 .cse28 .cse0 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22) (and .cse27 .cse28 .cse0 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse11 .cse12 .cse24 .cse14 .cse16 .cse18 .cse25 .cse20 .cse26) (and .cse27 .cse28 .cse0 .cse1 .cse29 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse27 .cse28 .cse0 .cse1 .cse29 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22) (and .cse27 .cse28 .cse0 .cse1 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse23 .cse10 .cse12 .cse24 .cse14 .cse15 .cse16 .cse18 .cse20) (and .cse27 .cse28 .cse0 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse27 .cse28 .cse0 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse10 .cse11 .cse12 .cse24 .cse14 .cse15 .cse16 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse23 .cse10 .cse11 .cse12 .cse24 .cse14 .cse15 .cse16 .cse18 .cse20) (and .cse27 .cse28 .cse0 .cse1 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse23 .cse12 .cse24 .cse14 .cse16 .cse18 .cse25 .cse20 .cse26) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse23 .cse11 .cse12 .cse24 .cse14 .cse16 .cse18 .cse25 .cse20 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20) (let ((.cse31 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~token~0 .cse31) .cse7 .cse8 .cse9 .cse23 .cse11 .cse12 .cse24 .cse14 .cse16 .cse18 .cse25 .cse20 (<= .cse31 ~token~0)))))) [2021-07-05 10:19:03,651 INFO L758 garLoopResultBuilder]: At program point L219-5(lines 207 221) the Hoare annotation is: (let ((.cse15 (= 0 ~t2_st~0)) (.cse8 (= ~t1_pc~0 1))) (let ((.cse17 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse19 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse22 (= ~m_pc~0 0)) (.cse27 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse28 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse29 (not .cse8)) (.cse30 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse26 (not .cse15)) (.cse3 (<= ~token~0 ~local~0)) (.cse10 (= 0 ~t2_pc~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 1))) (.cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (not (= ~E_2~0 0))) (.cse5 (not (= ~T2_E~0 0))) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse23 (= ~m_pc~0 1)) (.cse11 (not (= ~t1_st~0 0))) (.cse12 (not (= ~E_2~0 1))) (.cse24 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_M~0 0))) (.cse16 (not (= ~T1_E~0 0))) (.cse18 (not (= ~T2_E~0 1))) (.cse25 (= ~t2_pc~0 1)) (.cse20 (= ~t1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse12 .cse24 .cse13 .cse14 .cse16 .cse18 .cse25 .cse20 .cse26) (and .cse0 .cse1 (< ~token~0 (+ 3 ~local~0)) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse11 .cse12 .cse14 (<= (+ 2 ~local~0) ~token~0) .cse16 .cse18 .cse25 .cse20 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse12 .cse24 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse27 .cse28 .cse0 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse11 .cse12 .cse14 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22) (and .cse27 .cse28 .cse0 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse11 .cse12 .cse24 .cse14 .cse16 .cse18 .cse25 .cse20 .cse26) (and .cse27 .cse28 .cse0 .cse1 .cse29 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse27 .cse28 .cse0 .cse1 .cse29 .cse2 .cse3 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22) (and .cse27 .cse28 .cse0 .cse1 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse23 .cse10 .cse12 .cse24 .cse14 .cse15 .cse16 .cse18 .cse20) (and .cse27 .cse28 .cse0 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse27 .cse28 .cse0 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse10 .cse11 .cse12 .cse24 .cse14 .cse15 .cse16 .cse18 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse23 .cse10 .cse11 .cse12 .cse24 .cse14 .cse15 .cse16 .cse18 .cse20) (and .cse27 .cse28 .cse0 .cse1 .cse29 .cse2 .cse4 .cse5 .cse6 .cse30 .cse7 .cse9 .cse23 .cse12 .cse24 .cse14 .cse16 .cse18 .cse25 .cse20 .cse26) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse23 .cse11 .cse12 .cse24 .cse14 .cse16 .cse18 .cse25 .cse20 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20) (let ((.cse31 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= ~token~0 .cse31) .cse7 .cse8 .cse9 .cse23 .cse11 .cse12 .cse24 .cse14 .cse16 .cse18 .cse25 .cse20 (<= .cse31 ~token~0)))))) [2021-07-05 10:19:03,651 INFO L762 garLoopResultBuilder]: For program point L286(line 286) no Hoare annotation was computed. [2021-07-05 10:19:03,652 INFO L758 garLoopResultBuilder]: At program point L220(lines 204 222) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse4 (= ~E_2~0 ~M_E~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~E_1~0 ~M_E~0)) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse8 (= ~T2_E~0 ~M_E~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (= ~t1_st~0 0)) (.cse13 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= ~M_E~0 2)) (.cse16 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse17 (= ~t1_i~0 1)) (.cse18 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse19 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~m_st~0 0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ~t2_pc~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-07-05 10:19:03,652 INFO L758 garLoopResultBuilder]: At program point L220-1(lines 204 222) the Hoare annotation is: (let ((.cse14 (= 0 ~t2_st~0)) (.cse7 (= ~t1_pc~0 1))) (let ((.cse2 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse9 (= 0 ~t2_pc~0)) (.cse19 (not (= ~t1_st~0 0))) (.cse22 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse23 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse0 (not (= ~E_M~0 1))) (.cse24 (not .cse7)) (.cse1 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse3 (not (= ~E_2~0 0))) (.cse4 (not (= ~T2_E~0 0))) (.cse5 (not (= ~T1_E~0 1))) (.cse25 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse6 (not (= ~E_1~0 0))) (.cse8 (= ~t2_i~0 1)) (.cse10 (not (= ~E_2~0 1))) (.cse11 (not (= ~m_st~0 0))) (.cse13 (not (= ~E_M~0 0))) (.cse15 (not (= ~T1_E~0 0))) (.cse16 (not (= ~T2_E~0 1))) (.cse17 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse20 (= ~t2_pc~0 1)) (.cse18 (= ~t1_i~0 1)) (.cse21 (not .cse14))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse19 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse20 .cse18 .cse21) (and .cse22 .cse23 .cse0 .cse24 .cse1 .cse3 .cse4 .cse5 .cse25 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse19 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse20 .cse18 .cse21) (and .cse22 .cse23 .cse0 .cse24 .cse1 .cse3 .cse4 .cse5 .cse25 .cse6 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse20 .cse18 .cse21)))) [2021-07-05 10:19:03,652 INFO L758 garLoopResultBuilder]: At program point L220-2(lines 204 222) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0))) (let ((.cse13 (= ~t2_pc~0 1)) (.cse15 (not .cse18)) (.cse0 (not (= ~E_M~0 1))) (.cse1 (not (= ~E_1~0 1))) (.cse16 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse6 (not (= ~E_1~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~m_pc~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ~E_M~0 0))) (.cse11 (not (= ~T1_E~0 0))) (.cse12 (not (= ~T2_E~0 1))) (.cse17 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse14 (= ~t1_i~0 1))) (or (let ((.cse5 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 (= ~t1_pc~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= .cse5 ~token~0))) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse14 (= ULTIMATE.start_activate_threads_~tmp~1 0) (= ~m_pc~0 0)) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 (= 0 ~t2_pc~0) .cse9 .cse10 .cse18 .cse11 .cse12 .cse17 .cse14)))) [2021-07-05 10:19:03,652 INFO L758 garLoopResultBuilder]: At program point L220-3(lines 204 222) the Hoare annotation is: (let ((.cse18 (= ~t1_pc~0 1))) (let ((.cse0 (not (= ~E_1~0 1))) (.cse7 (= ~m_pc~0 1)) (.cse19 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse22 (= ~m_pc~0 0)) (.cse23 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse24 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse25 (not .cse18)) (.cse1 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse26 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~t2_i~0 1)) (.cse8 (not (= ~t1_st~0 0))) (.cse9 (not (= ~E_2~0 1))) (.cse10 (not (= ~m_st~0 0))) (.cse11 (not (= ~E_M~0 0))) (.cse12 (not (= ~T1_E~0 0))) (.cse13 (not (= ~T2_E~0 1))) (.cse14 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse15 (= ~t2_pc~0 1)) (.cse16 (= ~t1_i~0 1)) (.cse17 (not (= 0 ~t2_st~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (< ~token~0 (+ 3 ~local~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse11 (<= (+ 2 ~local~0) ~token~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse20 .cse14 .cse16 .cse21 .cse22) (and .cse23 .cse24 .cse25 .cse1 .cse2 .cse3 .cse4 .cse26 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse19 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse21 .cse22) (and .cse23 .cse24 .cse25 .cse1 .cse2 .cse3 .cse4 .cse26 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2021-07-05 10:19:03,652 INFO L758 garLoopResultBuilder]: At program point L220-4(lines 204 222) the Hoare annotation is: (let ((.cse24 (= 0 ~t2_st~0)) (.cse20 (= ~t1_pc~0 1))) (let ((.cse21 (= 0 ~t2_pc~0)) (.cse28 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse29 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse30 (not .cse20)) (.cse31 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse19 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse11 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse16 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse17 (= ~m_pc~0 0)) (.cse0 (not (= ~E_M~0 1))) (.cse18 (not (= ~E_1~0 1))) (.cse1 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~t2_i~0 1)) (.cse25 (= ~m_pc~0 1)) (.cse22 (not (= ~t1_st~0 0))) (.cse7 (not (= ~E_2~0 1))) (.cse9 (not (= ~E_M~0 0))) (.cse10 (not (= ~T1_E~0 0))) (.cse12 (not (= ~T2_E~0 1))) (.cse14 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse26 (= ~t2_pc~0 1)) (.cse15 (= ~t1_i~0 1)) (.cse27 (not .cse24))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse21 .cse22 .cse7 .cse23 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse26 .cse15 .cse27) (and .cse28 .cse29 .cse0 .cse18 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse25 .cse21 .cse7 .cse8 .cse9 .cse24 .cse10 .cse12 .cse14 .cse15) (and .cse28 .cse29 .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse21 .cse22 .cse7 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse28 .cse29 .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse21 .cse22 .cse7 .cse8 .cse9 .cse24 .cse10 .cse12 .cse14 .cse15) (let ((.cse32 (+ ~local~0 1))) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse32) .cse5 .cse20 .cse6 .cse25 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse26 .cse15 (<= .cse32 ~token~0))) (and .cse28 .cse29 .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse22 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse27 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse25 .cse7 .cse8 .cse23 .cse9 .cse10 .cse12 .cse14 .cse26 .cse15 .cse27) (and .cse28 .cse29 .cse0 .cse18 .cse30 .cse1 .cse19 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse21 .cse7 .cse23 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse25 .cse21 .cse7 .cse8 .cse23 .cse9 .cse24 .cse10 .cse12 .cse14 .cse15) (and .cse28 .cse29 .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse26 .cse15 .cse27) (and .cse28 .cse29 .cse0 .cse18 .cse30 .cse1 .cse19 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse27 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse21 .cse22 .cse7 .cse8 .cse9 .cse24 .cse10 .cse12 .cse14 .cse15) (and .cse28 .cse29 .cse0 .cse18 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse25 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse26 .cse15 .cse27) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse22 .cse7 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse27 .cse16 .cse17) (and .cse0 .cse18 (< ~token~0 (+ 3 ~local~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse25 .cse22 .cse7 .cse9 (<= (+ 2 ~local~0) ~token~0) .cse10 .cse12 .cse14 .cse26 .cse15 .cse27)))) [2021-07-05 10:19:03,653 INFO L758 garLoopResultBuilder]: At program point L220-5(lines 204 222) the Hoare annotation is: (let ((.cse24 (= 0 ~t2_st~0)) (.cse20 (= ~t1_pc~0 1))) (let ((.cse21 (= 0 ~t2_pc~0)) (.cse28 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse29 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse30 (not .cse20)) (.cse31 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse8 (not (= ~m_st~0 0))) (.cse19 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse11 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse16 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse17 (= ~m_pc~0 0)) (.cse0 (not (= ~E_M~0 1))) (.cse18 (not (= ~E_1~0 1))) (.cse1 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (not (= ~E_2~0 0))) (.cse3 (not (= ~T2_E~0 0))) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (not (= ~E_1~0 0))) (.cse6 (= ~t2_i~0 1)) (.cse25 (= ~m_pc~0 1)) (.cse22 (not (= ~t1_st~0 0))) (.cse7 (not (= ~E_2~0 1))) (.cse9 (not (= ~E_M~0 0))) (.cse10 (not (= ~T1_E~0 0))) (.cse12 (not (= ~T2_E~0 1))) (.cse14 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse26 (= ~t2_pc~0 1)) (.cse15 (= ~t1_i~0 1)) (.cse27 (not .cse24))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse21 .cse22 .cse7 .cse23 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse26 .cse15 .cse27) (and .cse28 .cse29 .cse0 .cse18 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse25 .cse21 .cse7 .cse8 .cse9 .cse24 .cse10 .cse12 .cse14 .cse15) (and .cse28 .cse29 .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse21 .cse22 .cse7 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse28 .cse29 .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse21 .cse22 .cse7 .cse8 .cse9 .cse24 .cse10 .cse12 .cse14 .cse15) (let ((.cse32 (+ ~local~0 1))) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse32) .cse5 .cse20 .cse6 .cse25 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse26 .cse15 (<= .cse32 ~token~0))) (and .cse28 .cse29 .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse22 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse27 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse25 .cse7 .cse8 .cse23 .cse9 .cse10 .cse12 .cse14 .cse26 .cse15 .cse27) (and .cse28 .cse29 .cse0 .cse18 .cse30 .cse1 .cse19 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse21 .cse7 .cse23 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse25 .cse21 .cse7 .cse8 .cse23 .cse9 .cse24 .cse10 .cse12 .cse14 .cse15) (and .cse28 .cse29 .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse26 .cse15 .cse27) (and .cse28 .cse29 .cse0 .cse18 .cse30 .cse1 .cse19 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse27 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse25 .cse21 .cse22 .cse7 .cse8 .cse9 .cse24 .cse10 .cse12 .cse14 .cse15) (and .cse28 .cse29 .cse0 .cse18 .cse30 .cse1 .cse2 .cse3 .cse4 .cse31 .cse5 .cse6 .cse25 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse26 .cse15 .cse27) (and .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse22 .cse7 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse27 .cse16 .cse17) (and .cse0 .cse18 (< ~token~0 (+ 3 ~local~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse25 .cse22 .cse7 .cse9 (<= (+ 2 ~local~0) ~token~0) .cse10 .cse12 .cse14 .cse26 .cse15 .cse27)))) [2021-07-05 10:19:03,653 INFO L762 garLoopResultBuilder]: For program point L353-1(lines 347 380) no Hoare annotation was computed. [2021-07-05 10:19:03,653 INFO L762 garLoopResultBuilder]: For program point L353-3(lines 347 380) no Hoare annotation was computed. [2021-07-05 10:19:03,653 INFO L762 garLoopResultBuilder]: For program point L488-1(lines 477 510) no Hoare annotation was computed. [2021-07-05 10:19:03,653 INFO L762 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2021-07-05 10:19:03,653 INFO L762 garLoopResultBuilder]: For program point L290-1(lines 285 337) no Hoare annotation was computed. [2021-07-05 10:19:03,653 INFO L762 garLoopResultBuilder]: For program point L358-1(lines 347 380) no Hoare annotation was computed. [2021-07-05 10:19:03,653 INFO L762 garLoopResultBuilder]: For program point L358-3(lines 347 380) no Hoare annotation was computed. [2021-07-05 10:19:03,653 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 10:19:03,654 INFO L758 garLoopResultBuilder]: At program point L557-1(lines 382 594) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse29 (= ~t1_pc~0 1))) (let ((.cse12 (= ~m_pc~0 1)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not .cse29)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse31 (= ~t2_pc~0 1)) (.cse32 (not .cse18)) (.cse3 (not (= ~E_1~0 1))) (.cse23 (<= ~token~0 ~local~0)) (.cse14 (= 0 ~t2_pc~0)) (.cse30 (not (= ~t1_st~0 0))) (.cse24 (<= ~local~0 ~token~0)) (.cse2 (not (= ~E_M~0 1))) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse16 (not (= ~m_st~0 0))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse25 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse26 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse22 (= ~t1_i~0 1)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse28 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse29 .cse11 .cse12 .cse13 .cse30 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse15 .cse16 .cse24 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse30 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse30 .cse15 .cse24 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse15 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse31 .cse22 .cse32 .cse27 .cse28) (and .cse2 .cse3 .cse5 .cse23 .cse6 .cse7 .cse8 .cse10 .cse29 .cse11 .cse13 .cse14 .cse30 .cse15 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28) (and .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse19 .cse25 .cse20 .cse26 .cse21 .cse22 .cse27 .cse28)))) [2021-07-05 10:19:03,654 INFO L762 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2021-07-05 10:19:03,654 INFO L758 garLoopResultBuilder]: At program point L228(lines 235 239) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~E_2~0 ~M_E~0) (= ~m_pc~0 ~t1_pc~0) (= ~E_1~0 ~M_E~0) (= ~T2_E~0 ~M_E~0) (= ~t2_i~0 1) (= ~E_M~0 ~M_E~0) (= 0 ~t2_pc~0) (<= ~local~0 ~token~0) (= 0 ~t2_st~0) (= ~t1_st~0 0) (= ~M_E~0 2) (= ~t1_i~0 1) (= ~m_pc~0 0)) [2021-07-05 10:19:03,654 INFO L758 garLoopResultBuilder]: At program point L228-1(lines 223 230) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse30 (= ~t1_pc~0 1))) (let ((.cse14 (= 0 ~t2_pc~0)) (.cse12 (= ~m_pc~0 1)) (.cse16 (not (= ~m_st~0 0))) (.cse3 (not (= ~E_1~0 1))) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse4 (not .cse30)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse23 (not (= ~t1_st~0 0))) (.cse15 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse26 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse27 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse31 (= ~t2_pc~0 1)) (.cse22 (= ~t1_i~0 1)) (.cse32 (not .cse18)) (.cse28 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse29 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse2 .cse6 .cse7 .cse8 .cse10 .cse11 .cse15 .cse16 .cse17 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse15 .cse16 .cse25 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse14 .cse23 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse23 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29)))) [2021-07-05 10:19:03,654 INFO L762 garLoopResultBuilder]: For program point L493-1(lines 477 510) no Hoare annotation was computed. [2021-07-05 10:19:03,655 INFO L758 garLoopResultBuilder]: At program point L295(lines 285 337) the Hoare annotation is: (let ((.cse18 (= 0 ~t2_st~0)) (.cse30 (= ~t1_pc~0 1))) (let ((.cse14 (= 0 ~t2_pc~0)) (.cse12 (= ~m_pc~0 1)) (.cse16 (not (= ~m_st~0 0))) (.cse3 (not (= ~E_1~0 1))) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_M~0 1))) (.cse4 (not .cse30)) (.cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse6 (not (= ~E_2~0 0))) (.cse7 (not (= ~T2_E~0 0))) (.cse8 (not (= ~T1_E~0 1))) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (not (= ~E_1~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___1~0 0)) (.cse23 (not (= ~t1_st~0 0))) (.cse15 (not (= ~E_2~0 1))) (.cse17 (not (= ~E_M~0 0))) (.cse19 (not (= ~T1_E~0 0))) (.cse26 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse20 (not (= ~T2_E~0 1))) (.cse27 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse21 (= |ULTIMATE.start_is_transmit2_triggered_#res| 0)) (.cse31 (= ~t2_pc~0 1)) (.cse22 (= ~t1_i~0 1)) (.cse32 (not .cse18)) (.cse28 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse29 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse2 .cse6 .cse7 .cse8 .cse10 .cse11 .cse15 .cse16 .cse17 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse15 .cse16 .cse25 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse22 .cse32) (and .cse2 .cse3 (< ~token~0 (+ 3 ~local~0)) .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse17 (<= (+ 2 ~local~0) ~token~0) .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 .cse32) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse14 .cse23 .cse15 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse22 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse23 .cse15 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22 .cse28 .cse29) (let ((.cse33 (+ ~local~0 1))) (and .cse2 .cse3 .cse6 .cse7 .cse8 (<= ~token~0 .cse33) .cse10 .cse30 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse19 .cse20 .cse31 .cse22 (<= .cse33 ~token~0))) (and .cse2 .cse3 .cse24 .cse6 .cse7 .cse8 .cse10 .cse30 .cse11 .cse23 .cse15 .cse25 .cse17 .cse19 .cse26 .cse20 .cse27 .cse31 .cse22 .cse32 .cse28 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse23 .cse15 .cse17 .cse19 .cse26 .cse20 .cse27 .cse21 .cse31 .cse22 .cse32 .cse28 .cse29)))) [2021-07-05 10:19:03,655 INFO L762 garLoopResultBuilder]: For program point L98(lines 98 106) no Hoare annotation was computed. [2021-07-05 10:19:03,655 INFO L762 garLoopResultBuilder]: For program point L429(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,655 INFO L762 garLoopResultBuilder]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,655 INFO L762 garLoopResultBuilder]: For program point L363-1(lines 347 380) no Hoare annotation was computed. [2021-07-05 10:19:03,655 INFO L762 garLoopResultBuilder]: For program point L429-3(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,655 INFO L762 garLoopResultBuilder]: For program point L429-5(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,655 INFO L762 garLoopResultBuilder]: For program point L363-3(lines 347 380) no Hoare annotation was computed. [2021-07-05 10:19:03,655 INFO L762 garLoopResultBuilder]: For program point L429-6(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,655 INFO L762 garLoopResultBuilder]: For program point L429-8(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,656 INFO L762 garLoopResultBuilder]: For program point L429-9(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,656 INFO L762 garLoopResultBuilder]: For program point L429-11(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,656 INFO L762 garLoopResultBuilder]: For program point L429-12(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,656 INFO L762 garLoopResultBuilder]: For program point L429-14(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,656 INFO L762 garLoopResultBuilder]: For program point L429-15(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,656 INFO L762 garLoopResultBuilder]: For program point L429-17(lines 429 433) no Hoare annotation was computed. [2021-07-05 10:19:03,656 INFO L762 garLoopResultBuilder]: For program point L298(lines 298 305) no Hoare annotation was computed. [2021-07-05 10:19:03,656 INFO L762 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2021-07-05 10:19:03,656 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-07-05 10:19:03,657 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 10:19:03,659 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/2) [2021-07-05 10:19:03,661 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 10:19:03,662 INFO L329 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 10:19:03,662 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 10:19:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 222 states have (on average 1.5855855855855856) internal successors, (352), 224 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-07-05 10:19:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-05 10:19:03,665 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:03,665 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:03,665 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1536438085, now seen corresponding path program 1 times [2021-07-05 10:19:03,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:03,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724805558] [2021-07-05 10:19:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:03,666 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:03,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:03,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:03,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:03,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:03,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724805558] [2021-07-05 10:19:03,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724805558] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:03,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:03,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:03,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275007745] [2021-07-05 10:19:03,678 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:19:03,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:03,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:19:03,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:03,679 INFO L87 Difference]: Start difference. First operand has 225 states, 222 states have (on average 1.5855855855855856) internal successors, (352), 224 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) Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:03,685 INFO L93 Difference]: Finished difference Result 445 states and 697 transitions. [2021-07-05 10:19:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:19:03,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2021-07-05 10:19:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:03,687 INFO L225 Difference]: With dead ends: 445 [2021-07-05 10:19:03,687 INFO L226 Difference]: Without dead ends: 219 [2021-07-05 10:19:03,687 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-07-05 10:19:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2021-07-05 10:19:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.5275229357798166) internal successors, (333), 218 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:19:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 333 transitions. [2021-07-05 10:19:03,690 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 333 transitions. Word has length 54 [2021-07-05 10:19:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:03,690 INFO L442 AbstractCegarLoop]: Abstraction has 219 states and 333 transitions. [2021-07-05 10:19:03,690 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 333 transitions. [2021-07-05 10:19:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-05 10:19:03,691 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:03,691 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:03,691 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-07-05 10:19:03,691 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:03,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2017518343, now seen corresponding path program 1 times [2021-07-05 10:19:03,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:03,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267082669] [2021-07-05 10:19:03,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:03,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:03,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:03,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:03,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:03,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267082669] [2021-07-05 10:19:03,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267082669] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:03,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:03,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 10:19:03,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515509097] [2021-07-05 10:19:03,702 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:19:03,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:19:03,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:03,703 INFO L87 Difference]: Start difference. First operand 219 states and 333 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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-07-05 10:19:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:03,716 INFO L93 Difference]: Finished difference Result 589 states and 895 transitions. [2021-07-05 10:19:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:19:03,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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 54 [2021-07-05 10:19:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:03,717 INFO L225 Difference]: With dead ends: 589 [2021-07-05 10:19:03,717 INFO L226 Difference]: Without dead ends: 377 [2021-07-05 10:19:03,718 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-07-05 10:19:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2021-07-05 10:19:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.5160427807486632) internal successors, (567), 374 states have internal predecessors, (567), 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-07-05 10:19:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 567 transitions. [2021-07-05 10:19:03,722 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 567 transitions. Word has length 54 [2021-07-05 10:19:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:03,722 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 567 transitions. [2021-07-05 10:19:03,722 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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-07-05 10:19:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 567 transitions. [2021-07-05 10:19:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-05 10:19:03,723 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:03,723 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:03,723 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-07-05 10:19:03,723 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:03,723 INFO L82 PathProgramCache]: Analyzing trace with hash -472300413, now seen corresponding path program 1 times [2021-07-05 10:19:03,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:03,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756310927] [2021-07-05 10:19:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:03,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:03,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:03,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:03,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:03,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:03,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756310927] [2021-07-05 10:19:03,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756310927] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:03,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:03,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:03,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921922092] [2021-07-05 10:19:03,736 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:03,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:03,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:03,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:03,736 INFO L87 Difference]: Start difference. First operand 375 states and 567 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:03,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:03,767 INFO L93 Difference]: Finished difference Result 899 states and 1358 transitions. [2021-07-05 10:19:03,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:19:03,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2021-07-05 10:19:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:03,769 INFO L225 Difference]: With dead ends: 899 [2021-07-05 10:19:03,769 INFO L226 Difference]: Without dead ends: 532 [2021-07-05 10:19:03,769 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-07-05 10:19:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 375. [2021-07-05 10:19:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.5080213903743316) internal successors, (564), 374 states have internal predecessors, (564), 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-07-05 10:19:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 564 transitions. [2021-07-05 10:19:03,774 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 564 transitions. Word has length 54 [2021-07-05 10:19:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:03,774 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 564 transitions. [2021-07-05 10:19:03,775 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 564 transitions. [2021-07-05 10:19:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-05 10:19:03,775 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:03,775 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:03,775 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-07-05 10:19:03,775 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:03,776 INFO L82 PathProgramCache]: Analyzing trace with hash -825388795, now seen corresponding path program 1 times [2021-07-05 10:19:03,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:03,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763362459] [2021-07-05 10:19:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:03,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:03,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:03,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:03,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:03,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:03,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763362459] [2021-07-05 10:19:03,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763362459] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:03,788 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:03,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:03,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198501655] [2021-07-05 10:19:03,788 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:03,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:03,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:03,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:03,789 INFO L87 Difference]: Start difference. First operand 375 states and 564 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:03,820 INFO L93 Difference]: Finished difference Result 897 states and 1348 transitions. [2021-07-05 10:19:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:19:03,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2021-07-05 10:19:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:03,821 INFO L225 Difference]: With dead ends: 897 [2021-07-05 10:19:03,821 INFO L226 Difference]: Without dead ends: 531 [2021-07-05 10:19:03,821 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:03,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-07-05 10:19:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 375. [2021-07-05 10:19:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.5) internal successors, (561), 374 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:19:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 561 transitions. [2021-07-05 10:19:03,827 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 561 transitions. Word has length 54 [2021-07-05 10:19:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:03,827 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 561 transitions. [2021-07-05 10:19:03,827 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 561 transitions. [2021-07-05 10:19:03,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-05 10:19:03,828 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:03,828 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:03,828 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-07-05 10:19:03,828 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:03,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:03,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1102883907, now seen corresponding path program 1 times [2021-07-05 10:19:03,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:03,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753235904] [2021-07-05 10:19:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:03,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:03,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:03,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:03,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:03,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:03,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753235904] [2021-07-05 10:19:03,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753235904] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:03,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:03,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:03,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52148202] [2021-07-05 10:19:03,841 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:03,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:03,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:03,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:03,841 INFO L87 Difference]: Start difference. First operand 375 states and 561 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:03,891 INFO L93 Difference]: Finished difference Result 874 states and 1308 transitions. [2021-07-05 10:19:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:19:03,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2021-07-05 10:19:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:03,892 INFO L225 Difference]: With dead ends: 874 [2021-07-05 10:19:03,893 INFO L226 Difference]: Without dead ends: 509 [2021-07-05 10:19:03,893 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-07-05 10:19:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 375. [2021-07-05 10:19:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.4919786096256684) internal successors, (558), 374 states have internal predecessors, (558), 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-07-05 10:19:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 558 transitions. [2021-07-05 10:19:03,899 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 558 transitions. Word has length 54 [2021-07-05 10:19:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:03,899 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 558 transitions. [2021-07-05 10:19:03,899 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 558 transitions. [2021-07-05 10:19:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-05 10:19:03,900 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:03,900 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:03,900 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-07-05 10:19:03,900 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:03,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:03,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1996370245, now seen corresponding path program 1 times [2021-07-05 10:19:03,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:03,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729577625] [2021-07-05 10:19:03,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:03,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:03,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:03,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:03,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:03,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:03,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729577625] [2021-07-05 10:19:03,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729577625] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:03,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:03,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:03,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413726969] [2021-07-05 10:19:03,915 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:03,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:03,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:03,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:03,916 INFO L87 Difference]: Start difference. First operand 375 states and 558 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:03,966 INFO L93 Difference]: Finished difference Result 872 states and 1298 transitions. [2021-07-05 10:19:03,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:19:03,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2021-07-05 10:19:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:03,967 INFO L225 Difference]: With dead ends: 872 [2021-07-05 10:19:03,967 INFO L226 Difference]: Without dead ends: 508 [2021-07-05 10:19:03,968 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-07-05 10:19:03,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 375. [2021-07-05 10:19:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.4839572192513368) internal successors, (555), 374 states have internal predecessors, (555), 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-07-05 10:19:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 555 transitions. [2021-07-05 10:19:03,975 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 555 transitions. Word has length 54 [2021-07-05 10:19:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:03,976 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 555 transitions. [2021-07-05 10:19:03,976 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:03,976 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 555 transitions. [2021-07-05 10:19:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-05 10:19:03,976 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:03,976 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:03,976 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-07-05 10:19:03,977 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:03,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:03,977 INFO L82 PathProgramCache]: Analyzing trace with hash -53017597, now seen corresponding path program 1 times [2021-07-05 10:19:03,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:03,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537988006] [2021-07-05 10:19:03,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:03,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:03,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:03,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:03,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:03,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:03,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:03,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537988006] [2021-07-05 10:19:03,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537988006] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:03,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:03,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:03,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041666868] [2021-07-05 10:19:03,989 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:03,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:03,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:03,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:03,990 INFO L87 Difference]: Start difference. First operand 375 states and 555 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:04,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:04,042 INFO L93 Difference]: Finished difference Result 870 states and 1288 transitions. [2021-07-05 10:19:04,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:19:04,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2021-07-05 10:19:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:04,043 INFO L225 Difference]: With dead ends: 870 [2021-07-05 10:19:04,043 INFO L226 Difference]: Without dead ends: 507 [2021-07-05 10:19:04,044 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:04,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-07-05 10:19:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 375. [2021-07-05 10:19:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 1.4759358288770053) internal successors, (552), 374 states have internal predecessors, (552), 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-07-05 10:19:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 552 transitions. [2021-07-05 10:19:04,051 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 552 transitions. Word has length 54 [2021-07-05 10:19:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:04,051 INFO L442 AbstractCegarLoop]: Abstraction has 375 states and 552 transitions. [2021-07-05 10:19:04,051 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 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-07-05 10:19:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 552 transitions. [2021-07-05 10:19:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-05 10:19:04,052 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:04,052 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:04,052 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-07-05 10:19:04,052 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:04,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:04,054 INFO L82 PathProgramCache]: Analyzing trace with hash -950410875, now seen corresponding path program 1 times [2021-07-05 10:19:04,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:04,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602865587] [2021-07-05 10:19:04,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:04,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:04,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:04,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:04,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:04,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602865587] [2021-07-05 10:19:04,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602865587] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:04,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:04,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 10:19:04,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483035619] [2021-07-05 10:19:04,066 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:19:04,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:04,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:19:04,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:04,067 INFO L87 Difference]: Start difference. First operand 375 states and 552 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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-07-05 10:19:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:04,097 INFO L93 Difference]: Finished difference Result 1046 states and 1537 transitions. [2021-07-05 10:19:04,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:19:04,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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 54 [2021-07-05 10:19:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:04,099 INFO L225 Difference]: With dead ends: 1046 [2021-07-05 10:19:04,099 INFO L226 Difference]: Without dead ends: 685 [2021-07-05 10:19:04,099 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-07-05 10:19:04,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 647. [2021-07-05 10:19:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.4520123839009287) internal successors, (938), 646 states have internal predecessors, (938), 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-07-05 10:19:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 938 transitions. [2021-07-05 10:19:04,112 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 938 transitions. Word has length 54 [2021-07-05 10:19:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:04,112 INFO L442 AbstractCegarLoop]: Abstraction has 647 states and 938 transitions. [2021-07-05 10:19:04,112 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 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-07-05 10:19:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 938 transitions. [2021-07-05 10:19:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 10:19:04,113 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:04,113 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:04,113 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-07-05 10:19:04,113 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:04,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:04,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1990518305, now seen corresponding path program 1 times [2021-07-05 10:19:04,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:04,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135083729] [2021-07-05 10:19:04,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:04,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:04,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:04,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:04,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:04,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:04,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:04,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:19:04,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:04,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135083729] [2021-07-05 10:19:04,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135083729] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:04,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:04,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:19:04,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747305575] [2021-07-05 10:19:04,136 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:19:04,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:04,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:19:04,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:04,136 INFO L87 Difference]: Start difference. First operand 647 states and 938 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-07-05 10:19:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:04,220 INFO L93 Difference]: Finished difference Result 1875 states and 2731 transitions. [2021-07-05 10:19:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:19:04,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 85 [2021-07-05 10:19:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:04,222 INFO L225 Difference]: With dead ends: 1875 [2021-07-05 10:19:04,222 INFO L226 Difference]: Without dead ends: 1246 [2021-07-05 10:19:04,223 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:19:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2021-07-05 10:19:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 674. [2021-07-05 10:19:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 1.4219910846953938) internal successors, (957), 673 states have internal predecessors, (957), 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-07-05 10:19:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 957 transitions. [2021-07-05 10:19:04,240 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 957 transitions. Word has length 85 [2021-07-05 10:19:04,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:04,240 INFO L442 AbstractCegarLoop]: Abstraction has 674 states and 957 transitions. [2021-07-05 10:19:04,240 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-07-05 10:19:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 957 transitions. [2021-07-05 10:19:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 10:19:04,241 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:04,241 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:04,241 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-07-05 10:19:04,242 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1075749219, now seen corresponding path program 1 times [2021-07-05 10:19:04,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:04,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486852420] [2021-07-05 10:19:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:04,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:04,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:04,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:04,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:19:04,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:04,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486852420] [2021-07-05 10:19:04,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486852420] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:04,257 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:04,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:04,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008502914] [2021-07-05 10:19:04,258 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:04,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:04,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:04,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:04,258 INFO L87 Difference]: Start difference. First operand 674 states and 957 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-07-05 10:19:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:04,343 INFO L93 Difference]: Finished difference Result 2169 states and 3077 transitions. [2021-07-05 10:19:04,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:19:04,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 85 [2021-07-05 10:19:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:04,345 INFO L225 Difference]: With dead ends: 2169 [2021-07-05 10:19:04,345 INFO L226 Difference]: Without dead ends: 1515 [2021-07-05 10:19:04,346 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2021-07-05 10:19:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1195. [2021-07-05 10:19:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1194 states have (on average 1.414572864321608) internal successors, (1689), 1194 states have internal predecessors, (1689), 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-07-05 10:19:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1689 transitions. [2021-07-05 10:19:04,374 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1689 transitions. Word has length 85 [2021-07-05 10:19:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:04,375 INFO L442 AbstractCegarLoop]: Abstraction has 1195 states and 1689 transitions. [2021-07-05 10:19:04,375 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-07-05 10:19:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1689 transitions. [2021-07-05 10:19:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 10:19:04,376 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:04,376 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:04,376 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-07-05 10:19:04,376 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:04,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:04,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2041243516, now seen corresponding path program 1 times [2021-07-05 10:19:04,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:04,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272998580] [2021-07-05 10:19:04,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:04,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:04,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:04,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:04,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:04,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:04,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:19:04,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:04,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272998580] [2021-07-05 10:19:04,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272998580] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:04,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:04,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:19:04,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393888414] [2021-07-05 10:19:04,413 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:19:04,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:04,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:19:04,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:04,414 INFO L87 Difference]: Start difference. First operand 1195 states and 1689 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-07-05 10:19:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:04,618 INFO L93 Difference]: Finished difference Result 3360 states and 4778 transitions. [2021-07-05 10:19:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:19:04,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 85 [2021-07-05 10:19:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:04,621 INFO L225 Difference]: With dead ends: 3360 [2021-07-05 10:19:04,621 INFO L226 Difference]: Without dead ends: 2189 [2021-07-05 10:19:04,621 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:19:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2021-07-05 10:19:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1243. [2021-07-05 10:19:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.3880837359098228) internal successors, (1724), 1242 states have internal predecessors, (1724), 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-07-05 10:19:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1724 transitions. [2021-07-05 10:19:04,677 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1724 transitions. Word has length 85 [2021-07-05 10:19:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:04,677 INFO L442 AbstractCegarLoop]: Abstraction has 1243 states and 1724 transitions. [2021-07-05 10:19:04,677 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-07-05 10:19:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1724 transitions. [2021-07-05 10:19:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 10:19:04,678 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:04,678 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:04,678 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-07-05 10:19:04,678 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1512411912, now seen corresponding path program 1 times [2021-07-05 10:19:04,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:04,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771756328] [2021-07-05 10:19:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:04,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:04,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:04,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:04,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:19:04,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:04,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771756328] [2021-07-05 10:19:04,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771756328] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:04,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:04,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:04,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718546160] [2021-07-05 10:19:04,695 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:04,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:04,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:04,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:04,696 INFO L87 Difference]: Start difference. First operand 1243 states and 1724 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-07-05 10:19:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:04,763 INFO L93 Difference]: Finished difference Result 2989 states and 4142 transitions. [2021-07-05 10:19:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:19:04,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 85 [2021-07-05 10:19:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:04,765 INFO L225 Difference]: With dead ends: 2989 [2021-07-05 10:19:04,766 INFO L226 Difference]: Without dead ends: 1779 [2021-07-05 10:19:04,767 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2021-07-05 10:19:04,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1243. [2021-07-05 10:19:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.3743961352657006) internal successors, (1707), 1242 states have internal predecessors, (1707), 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-07-05 10:19:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1707 transitions. [2021-07-05 10:19:04,803 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1707 transitions. Word has length 85 [2021-07-05 10:19:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:04,803 INFO L442 AbstractCegarLoop]: Abstraction has 1243 states and 1707 transitions. [2021-07-05 10:19:04,803 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-07-05 10:19:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1707 transitions. [2021-07-05 10:19:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 10:19:04,804 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:04,804 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:04,804 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-07-05 10:19:04,804 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:04,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash -636392906, now seen corresponding path program 1 times [2021-07-05 10:19:04,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:04,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234538125] [2021-07-05 10:19:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:04,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:04,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:04,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:04,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:19:04,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:04,827 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234538125] [2021-07-05 10:19:04,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234538125] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:04,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:04,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:04,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928504063] [2021-07-05 10:19:04,828 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:04,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:04,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:04,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:04,828 INFO L87 Difference]: Start difference. First operand 1243 states and 1707 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-07-05 10:19:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:04,898 INFO L93 Difference]: Finished difference Result 2988 states and 4103 transitions. [2021-07-05 10:19:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:19:04,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 85 [2021-07-05 10:19:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:04,901 INFO L225 Difference]: With dead ends: 2988 [2021-07-05 10:19:04,901 INFO L226 Difference]: Without dead ends: 1779 [2021-07-05 10:19:04,902 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:04,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2021-07-05 10:19:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1243. [2021-07-05 10:19:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.3607085346215781) internal successors, (1690), 1242 states have internal predecessors, (1690), 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-07-05 10:19:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1690 transitions. [2021-07-05 10:19:04,939 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1690 transitions. Word has length 85 [2021-07-05 10:19:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:04,940 INFO L442 AbstractCegarLoop]: Abstraction has 1243 states and 1690 transitions. [2021-07-05 10:19:04,940 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-07-05 10:19:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1690 transitions. [2021-07-05 10:19:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 10:19:04,940 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:04,942 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:04,942 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-07-05 10:19:04,942 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:04,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:04,943 INFO L82 PathProgramCache]: Analyzing trace with hash -192492232, now seen corresponding path program 1 times [2021-07-05 10:19:04,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:04,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774237161] [2021-07-05 10:19:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:04,943 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:04,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:04,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:04,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:04,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:04,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:19:04,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:04,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774237161] [2021-07-05 10:19:04,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774237161] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:04,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:04,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:04,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480162931] [2021-07-05 10:19:04,960 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:04,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:04,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:04,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:04,960 INFO L87 Difference]: Start difference. First operand 1243 states and 1690 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-07-05 10:19:05,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:05,044 INFO L93 Difference]: Finished difference Result 2924 states and 3978 transitions. [2021-07-05 10:19:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:19:05,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 85 [2021-07-05 10:19:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:05,046 INFO L225 Difference]: With dead ends: 2924 [2021-07-05 10:19:05,046 INFO L226 Difference]: Without dead ends: 1716 [2021-07-05 10:19:05,047 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2021-07-05 10:19:05,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1207. [2021-07-05 10:19:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 1.3374792703150913) internal successors, (1613), 1206 states have internal predecessors, (1613), 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-07-05 10:19:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1613 transitions. [2021-07-05 10:19:05,085 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1613 transitions. Word has length 85 [2021-07-05 10:19:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:05,085 INFO L442 AbstractCegarLoop]: Abstraction has 1207 states and 1613 transitions. [2021-07-05 10:19:05,085 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-07-05 10:19:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1613 transitions. [2021-07-05 10:19:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 10:19:05,086 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:05,086 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:05,086 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-07-05 10:19:05,086 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:05,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:05,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1345847798, now seen corresponding path program 1 times [2021-07-05 10:19:05,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:05,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526883502] [2021-07-05 10:19:05,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:05,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:05,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:05,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:05,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:19:05,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:05,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526883502] [2021-07-05 10:19:05,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526883502] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:05,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:05,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:05,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767143419] [2021-07-05 10:19:05,121 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:05,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:05,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:05,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:05,122 INFO L87 Difference]: Start difference. First operand 1207 states and 1613 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-07-05 10:19:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:05,214 INFO L93 Difference]: Finished difference Result 2880 states and 3854 transitions. [2021-07-05 10:19:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:19:05,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 85 [2021-07-05 10:19:05,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:05,217 INFO L225 Difference]: With dead ends: 2880 [2021-07-05 10:19:05,217 INFO L226 Difference]: Without dead ends: 1701 [2021-07-05 10:19:05,219 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2021-07-05 10:19:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1207. [2021-07-05 10:19:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 1206 states have (on average 1.302653399668325) internal successors, (1571), 1206 states have internal predecessors, (1571), 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-07-05 10:19:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1571 transitions. [2021-07-05 10:19:05,259 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1571 transitions. Word has length 85 [2021-07-05 10:19:05,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:05,260 INFO L442 AbstractCegarLoop]: Abstraction has 1207 states and 1571 transitions. [2021-07-05 10:19:05,261 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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-07-05 10:19:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1571 transitions. [2021-07-05 10:19:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 10:19:05,261 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:05,261 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:05,262 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-07-05 10:19:05,262 INFO L374 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:05,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:05,262 INFO L82 PathProgramCache]: Analyzing trace with hash -725627437, now seen corresponding path program 1 times [2021-07-05 10:19:05,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:05,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740566601] [2021-07-05 10:19:05,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:05,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:05,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:05,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:05,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:05,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:05,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:05,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:05,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:05,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740566601] [2021-07-05 10:19:05,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740566601] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:05,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:05,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:19:05,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247430091] [2021-07-05 10:19:05,285 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:19:05,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:05,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:19:05,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:05,285 INFO L87 Difference]: Start difference. First operand 1207 states and 1571 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-07-05 10:19:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:05,385 INFO L93 Difference]: Finished difference Result 3013 states and 3937 transitions. [2021-07-05 10:19:05,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:19:05,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2021-07-05 10:19:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:05,388 INFO L225 Difference]: With dead ends: 3013 [2021-07-05 10:19:05,388 INFO L226 Difference]: Without dead ends: 1837 [2021-07-05 10:19:05,389 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:19:05,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2021-07-05 10:19:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1219. [2021-07-05 10:19:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1218 states have (on average 1.2791461412151068) internal successors, (1558), 1218 states have internal predecessors, (1558), 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-07-05 10:19:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1558 transitions. [2021-07-05 10:19:05,431 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1558 transitions. Word has length 85 [2021-07-05 10:19:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:05,432 INFO L442 AbstractCegarLoop]: Abstraction has 1219 states and 1558 transitions. [2021-07-05 10:19:05,432 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-07-05 10:19:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1558 transitions. [2021-07-05 10:19:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-07-05 10:19:05,433 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:05,433 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:05,433 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-07-05 10:19:05,433 INFO L374 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:05,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:05,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1543275887, now seen corresponding path program 1 times [2021-07-05 10:19:05,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:05,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978023436] [2021-07-05 10:19:05,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:05,434 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:05,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:05,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:05,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:05,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:05,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978023436] [2021-07-05 10:19:05,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978023436] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:05,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:05,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:05,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176037949] [2021-07-05 10:19:05,447 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:19:05,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:05,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:19:05,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:05,448 INFO L87 Difference]: Start difference. First operand 1219 states and 1558 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-07-05 10:19:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:05,537 INFO L93 Difference]: Finished difference Result 3469 states and 4420 transitions. [2021-07-05 10:19:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:19:05,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 85 [2021-07-05 10:19:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:05,539 INFO L225 Difference]: With dead ends: 3469 [2021-07-05 10:19:05,539 INFO L226 Difference]: Without dead ends: 2287 [2021-07-05 10:19:05,540 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:05,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2021-07-05 10:19:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2233. [2021-07-05 10:19:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 2232 states have (on average 1.257168458781362) internal successors, (2806), 2232 states have internal predecessors, (2806), 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-07-05 10:19:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 2806 transitions. [2021-07-05 10:19:05,619 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 2806 transitions. Word has length 85 [2021-07-05 10:19:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:05,619 INFO L442 AbstractCegarLoop]: Abstraction has 2233 states and 2806 transitions. [2021-07-05 10:19:05,619 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-07-05 10:19:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 2806 transitions. [2021-07-05 10:19:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-05 10:19:05,620 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:05,621 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:05,621 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-07-05 10:19:05,621 INFO L374 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:05,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1105504690, now seen corresponding path program 1 times [2021-07-05 10:19:05,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:05,621 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192267508] [2021-07-05 10:19:05,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:05,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:05,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:05,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:05,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:05,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:05,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192267508] [2021-07-05 10:19:05,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192267508] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:05,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:05,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:05,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948280345] [2021-07-05 10:19:05,636 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:19:05,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:05,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:19:05,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:05,637 INFO L87 Difference]: Start difference. First operand 2233 states and 2806 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-07-05 10:19:05,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:05,778 INFO L93 Difference]: Finished difference Result 6192 states and 7793 transitions. [2021-07-05 10:19:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:19:05,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 86 [2021-07-05 10:19:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:05,781 INFO L225 Difference]: With dead ends: 6192 [2021-07-05 10:19:05,781 INFO L226 Difference]: Without dead ends: 3996 [2021-07-05 10:19:05,783 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2021-07-05 10:19:05,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 3994. [2021-07-05 10:19:05,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3994 states, 3993 states have (on average 1.2489356373653895) internal successors, (4987), 3993 states have internal predecessors, (4987), 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-07-05 10:19:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 4987 transitions. [2021-07-05 10:19:05,923 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 4987 transitions. Word has length 86 [2021-07-05 10:19:05,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:05,923 INFO L442 AbstractCegarLoop]: Abstraction has 3994 states and 4987 transitions. [2021-07-05 10:19:05,923 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-07-05 10:19:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 4987 transitions. [2021-07-05 10:19:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-05 10:19:05,925 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:05,925 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:05,925 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-07-05 10:19:05,925 INFO L374 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:05,925 INFO L82 PathProgramCache]: Analyzing trace with hash 47666612, now seen corresponding path program 1 times [2021-07-05 10:19:05,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:05,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159800849] [2021-07-05 10:19:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:05,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:05,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:05,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:05,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:05,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-07-05 10:19:05,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:05,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159800849] [2021-07-05 10:19:05,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159800849] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:05,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:05,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:05,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138606282] [2021-07-05 10:19:05,936 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:19:05,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:05,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:19:05,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:05,936 INFO L87 Difference]: Start difference. First operand 3994 states and 4987 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-07-05 10:19:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:06,100 INFO L93 Difference]: Finished difference Result 7920 states and 9900 transitions. [2021-07-05 10:19:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:19:06,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 86 [2021-07-05 10:19:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:06,104 INFO L225 Difference]: With dead ends: 7920 [2021-07-05 10:19:06,104 INFO L226 Difference]: Without dead ends: 3963 [2021-07-05 10:19:06,106 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2021-07-05 10:19:06,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3963. [2021-07-05 10:19:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3962 states have (on average 1.2501261988894499) internal successors, (4953), 3962 states have internal predecessors, (4953), 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-07-05 10:19:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 4953 transitions. [2021-07-05 10:19:06,251 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 4953 transitions. Word has length 86 [2021-07-05 10:19:06,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:06,252 INFO L442 AbstractCegarLoop]: Abstraction has 3963 states and 4953 transitions. [2021-07-05 10:19:06,252 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-07-05 10:19:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 4953 transitions. [2021-07-05 10:19:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-05 10:19:06,253 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:06,253 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:19:06,253 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-07-05 10:19:06,253 INFO L374 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:06,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:06,254 INFO L82 PathProgramCache]: Analyzing trace with hash -155882127, now seen corresponding path program 1 times [2021-07-05 10:19:06,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:06,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527255868] [2021-07-05 10:19:06,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:06,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:06,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:06,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:06,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:06,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:06,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:06,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:06,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:06,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:06,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:06,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527255868] [2021-07-05 10:19:06,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527255868] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:06,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:06,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:19:06,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094387227] [2021-07-05 10:19:06,269 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:06,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:06,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:06,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:06,270 INFO L87 Difference]: Start difference. First operand 3963 states and 4953 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:19:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:06,572 INFO L93 Difference]: Finished difference Result 11096 states and 13790 transitions. [2021-07-05 10:19:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:19:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-07-05 10:19:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:06,578 INFO L225 Difference]: With dead ends: 11096 [2021-07-05 10:19:06,578 INFO L226 Difference]: Without dead ends: 5509 [2021-07-05 10:19:06,583 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:06,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2021-07-05 10:19:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5507. [2021-07-05 10:19:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5507 states, 5506 states have (on average 1.2197602615328733) internal successors, (6716), 5506 states have internal predecessors, (6716), 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-07-05 10:19:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5507 states to 5507 states and 6716 transitions. [2021-07-05 10:19:06,823 INFO L78 Accepts]: Start accepts. Automaton has 5507 states and 6716 transitions. Word has length 87 [2021-07-05 10:19:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:06,824 INFO L442 AbstractCegarLoop]: Abstraction has 5507 states and 6716 transitions. [2021-07-05 10:19:06,824 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:19:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5507 states and 6716 transitions. [2021-07-05 10:19:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-07-05 10:19:06,826 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:06,826 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:19:06,826 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-07-05 10:19:06,826 INFO L374 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:06,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:06,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1891772885, now seen corresponding path program 1 times [2021-07-05 10:19:06,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:06,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128318951] [2021-07-05 10:19:06,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:06,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:06,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:06,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:06,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:06,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:06,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:06,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128318951] [2021-07-05 10:19:06,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128318951] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:06,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:06,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 10:19:06,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233900511] [2021-07-05 10:19:06,852 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:19:06,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:06,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:19:06,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:06,852 INFO L87 Difference]: Start difference. First operand 5507 states and 6716 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-07-05 10:19:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:07,174 INFO L93 Difference]: Finished difference Result 12609 states and 15320 transitions. [2021-07-05 10:19:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:19:07,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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 110 [2021-07-05 10:19:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:07,179 INFO L225 Difference]: With dead ends: 12609 [2021-07-05 10:19:07,179 INFO L226 Difference]: Without dead ends: 7128 [2021-07-05 10:19:07,181 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:07,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7128 states. [2021-07-05 10:19:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7128 to 7080. [2021-07-05 10:19:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7080 states, 7079 states have (on average 1.2049724537364035) internal successors, (8530), 7079 states have internal predecessors, (8530), 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-07-05 10:19:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7080 states to 7080 states and 8530 transitions. [2021-07-05 10:19:07,459 INFO L78 Accepts]: Start accepts. Automaton has 7080 states and 8530 transitions. Word has length 110 [2021-07-05 10:19:07,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:07,459 INFO L442 AbstractCegarLoop]: Abstraction has 7080 states and 8530 transitions. [2021-07-05 10:19:07,459 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-07-05 10:19:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 7080 states and 8530 transitions. [2021-07-05 10:19:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-07-05 10:19:07,462 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:07,463 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:19:07,463 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-07-05 10:19:07,463 INFO L374 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:07,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:07,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2058414685, now seen corresponding path program 1 times [2021-07-05 10:19:07,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:07,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904442789] [2021-07-05 10:19:07,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:07,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:07,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:07,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:07,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:07,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:07,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:07,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:07,479 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:07,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:07,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904442789] [2021-07-05 10:19:07,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904442789] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:07,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:07,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:07,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998328101] [2021-07-05 10:19:07,480 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:19:07,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:07,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:19:07,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:07,481 INFO L87 Difference]: Start difference. First operand 7080 states and 8530 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-07-05 10:19:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:07,767 INFO L93 Difference]: Finished difference Result 12582 states and 15239 transitions. [2021-07-05 10:19:07,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:19:07,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 125 [2021-07-05 10:19:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:07,773 INFO L225 Difference]: With dead ends: 12582 [2021-07-05 10:19:07,773 INFO L226 Difference]: Without dead ends: 7112 [2021-07-05 10:19:07,778 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7112 states. [2021-07-05 10:19:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7112 to 7080. [2021-07-05 10:19:08,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7080 states, 7079 states have (on average 1.1806752366153412) internal successors, (8358), 7079 states have internal predecessors, (8358), 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-07-05 10:19:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7080 states to 7080 states and 8358 transitions. [2021-07-05 10:19:08,064 INFO L78 Accepts]: Start accepts. Automaton has 7080 states and 8358 transitions. Word has length 125 [2021-07-05 10:19:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:08,064 INFO L442 AbstractCegarLoop]: Abstraction has 7080 states and 8358 transitions. [2021-07-05 10:19:08,064 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-07-05 10:19:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7080 states and 8358 transitions. [2021-07-05 10:19:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-07-05 10:19:08,067 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:08,068 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:19:08,068 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-07-05 10:19:08,068 INFO L374 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:08,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:08,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1025119703, now seen corresponding path program 1 times [2021-07-05 10:19:08,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:08,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746077760] [2021-07-05 10:19:08,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:08,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:08,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:08,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:08,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:08,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:08,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:08,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:08,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:08,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:08,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:08,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746077760] [2021-07-05 10:19:08,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746077760] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:08,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:08,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:19:08,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073020133] [2021-07-05 10:19:08,087 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:08,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:08,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:08,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:08,088 INFO L87 Difference]: Start difference. First operand 7080 states and 8358 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-07-05 10:19:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:08,455 INFO L93 Difference]: Finished difference Result 12556 states and 14866 transitions. [2021-07-05 10:19:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:19:08,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 126 [2021-07-05 10:19:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:08,460 INFO L225 Difference]: With dead ends: 12556 [2021-07-05 10:19:08,461 INFO L226 Difference]: Without dead ends: 7086 [2021-07-05 10:19:08,474 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7086 states. [2021-07-05 10:19:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7086 to 7080. [2021-07-05 10:19:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7080 states, 7079 states have (on average 1.1755897725667468) internal successors, (8322), 7079 states have internal predecessors, (8322), 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-07-05 10:19:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7080 states to 7080 states and 8322 transitions. [2021-07-05 10:19:08,773 INFO L78 Accepts]: Start accepts. Automaton has 7080 states and 8322 transitions. Word has length 126 [2021-07-05 10:19:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:08,773 INFO L442 AbstractCegarLoop]: Abstraction has 7080 states and 8322 transitions. [2021-07-05 10:19:08,774 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-07-05 10:19:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 7080 states and 8322 transitions. [2021-07-05 10:19:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-07-05 10:19:08,778 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:08,778 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:19:08,778 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-07-05 10:19:08,778 INFO L374 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:08,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:08,780 INFO L82 PathProgramCache]: Analyzing trace with hash 22393651, now seen corresponding path program 1 times [2021-07-05 10:19:08,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:08,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576183243] [2021-07-05 10:19:08,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:08,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:08,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:08,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:08,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:08,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:08,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:08,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:08,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:08,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-05 10:19:08,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:08,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576183243] [2021-07-05 10:19:08,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576183243] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:08,848 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:08,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:19:08,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605845934] [2021-07-05 10:19:08,849 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:08,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:08,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:08,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:08,849 INFO L87 Difference]: Start difference. First operand 7080 states and 8322 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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-07-05 10:19:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:09,188 INFO L93 Difference]: Finished difference Result 14322 states and 16826 transitions. [2021-07-05 10:19:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:19:09,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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 152 [2021-07-05 10:19:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:09,195 INFO L225 Difference]: With dead ends: 14322 [2021-07-05 10:19:09,195 INFO L226 Difference]: Without dead ends: 6484 [2021-07-05 10:19:09,201 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2021-07-05 10:19:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 6278. [2021-07-05 10:19:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6278 states, 6277 states have (on average 1.168711167755297) internal successors, (7336), 6277 states have internal predecessors, (7336), 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-07-05 10:19:09,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 7336 transitions. [2021-07-05 10:19:09,464 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 7336 transitions. Word has length 152 [2021-07-05 10:19:09,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:09,465 INFO L442 AbstractCegarLoop]: Abstraction has 6278 states and 7336 transitions. [2021-07-05 10:19:09,465 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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-07-05 10:19:09,465 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 7336 transitions. [2021-07-05 10:19:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-07-05 10:19:09,467 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:09,468 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:19:09,468 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-07-05 10:19:09,468 INFO L374 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:09,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:09,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1221842258, now seen corresponding path program 1 times [2021-07-05 10:19:09,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:09,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677052840] [2021-07-05 10:19:09,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:09,469 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:09,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:09,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:09,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:09,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:09,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:09,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-05 10:19:09,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:09,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677052840] [2021-07-05 10:19:09,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677052840] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:09,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:09,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:09,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860071263] [2021-07-05 10:19:09,487 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:19:09,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:09,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:19:09,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:09,488 INFO L87 Difference]: Start difference. First operand 6278 states and 7336 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-07-05 10:19:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:09,795 INFO L93 Difference]: Finished difference Result 10743 states and 12594 transitions. [2021-07-05 10:19:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:19:09,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 153 [2021-07-05 10:19:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:09,802 INFO L225 Difference]: With dead ends: 10743 [2021-07-05 10:19:09,803 INFO L226 Difference]: Without dead ends: 6562 [2021-07-05 10:19:09,806 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2021-07-05 10:19:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 6278. [2021-07-05 10:19:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6278 states, 6277 states have (on average 1.149593754978493) internal successors, (7216), 6277 states have internal predecessors, (7216), 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-07-05 10:19:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 7216 transitions. [2021-07-05 10:19:10,071 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 7216 transitions. Word has length 153 [2021-07-05 10:19:10,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:10,071 INFO L442 AbstractCegarLoop]: Abstraction has 6278 states and 7216 transitions. [2021-07-05 10:19:10,071 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-07-05 10:19:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 7216 transitions. [2021-07-05 10:19:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-07-05 10:19:10,074 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:10,074 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:19:10,074 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-07-05 10:19:10,074 INFO L374 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:10,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:10,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1243858453, now seen corresponding path program 1 times [2021-07-05 10:19:10,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:10,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841920757] [2021-07-05 10:19:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:10,075 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:10,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:10,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:10,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:10,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:10,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:10,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:10,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:10,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-05 10:19:10,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:10,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841920757] [2021-07-05 10:19:10,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841920757] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:10,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:10,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:19:10,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095713543] [2021-07-05 10:19:10,097 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:19:10,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:10,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:19:10,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:19:10,097 INFO L87 Difference]: Start difference. First operand 6278 states and 7216 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-07-05 10:19:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:10,263 INFO L93 Difference]: Finished difference Result 9040 states and 10300 transitions. [2021-07-05 10:19:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:19:10,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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 154 [2021-07-05 10:19:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:10,265 INFO L225 Difference]: With dead ends: 9040 [2021-07-05 10:19:10,265 INFO L226 Difference]: Without dead ends: 1881 [2021-07-05 10:19:10,269 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:19:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2021-07-05 10:19:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1871. [2021-07-05 10:19:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1870 states have (on average 1.0748663101604279) internal successors, (2010), 1870 states have internal predecessors, (2010), 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-07-05 10:19:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2010 transitions. [2021-07-05 10:19:10,347 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2010 transitions. Word has length 154 [2021-07-05 10:19:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:10,348 INFO L442 AbstractCegarLoop]: Abstraction has 1871 states and 2010 transitions. [2021-07-05 10:19:10,348 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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-07-05 10:19:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2010 transitions. [2021-07-05 10:19:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-07-05 10:19:10,349 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:10,349 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:19:10,349 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-07-05 10:19:10,350 INFO L374 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:10,350 INFO L82 PathProgramCache]: Analyzing trace with hash 453989195, now seen corresponding path program 1 times [2021-07-05 10:19:10,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:10,350 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901826664] [2021-07-05 10:19:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:10,350 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:10,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:10,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:10,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:10,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:19:10,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:10,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:19:10,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:10,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901826664] [2021-07-05 10:19:10,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901826664] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:10,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:10,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:10,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287201039] [2021-07-05 10:19:10,370 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:19:10,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:19:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:10,371 INFO L87 Difference]: Start difference. First operand 1871 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-07-05 10:19:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:10,445 INFO L93 Difference]: Finished difference Result 2507 states and 2698 transitions. [2021-07-05 10:19:10,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:19:10,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 154 [2021-07-05 10:19:10,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:10,447 INFO L225 Difference]: With dead ends: 2507 [2021-07-05 10:19:10,447 INFO L226 Difference]: Without dead ends: 1505 [2021-07-05 10:19:10,448 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2021-07-05 10:19:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2021-07-05 10:19:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.0704787234042554) internal successors, (1610), 1504 states have internal predecessors, (1610), 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-07-05 10:19:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1610 transitions. [2021-07-05 10:19:10,510 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1610 transitions. Word has length 154 [2021-07-05 10:19:10,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:10,510 INFO L442 AbstractCegarLoop]: Abstraction has 1505 states and 1610 transitions. [2021-07-05 10:19:10,510 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-07-05 10:19:10,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1610 transitions. [2021-07-05 10:19:10,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-07-05 10:19:10,511 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:10,512 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:19:10,512 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-07-05 10:19:10,512 INFO L374 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:10,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:10,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1317806111, now seen corresponding path program 1 times [2021-07-05 10:19:10,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:10,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754551415] [2021-07-05 10:19:10,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:10,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:19:10,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:10,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:10,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:10,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:19:10,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:19:10,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:19:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-07-05 10:19:10,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:19:10,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754551415] [2021-07-05 10:19:10,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754551415] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:19:10,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:19:10,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:19:10,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876210487] [2021-07-05 10:19:10,537 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:19:10,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:19:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:19:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:10,537 INFO L87 Difference]: Start difference. First operand 1505 states and 1610 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-07-05 10:19:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:19:10,634 INFO L93 Difference]: Finished difference Result 2761 states and 2943 transitions. [2021-07-05 10:19:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:19:10,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 156 [2021-07-05 10:19:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:19:10,637 INFO L225 Difference]: With dead ends: 2761 [2021-07-05 10:19:10,637 INFO L226 Difference]: Without dead ends: 2125 [2021-07-05 10:19:10,639 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:19:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2021-07-05 10:19:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1507. [2021-07-05 10:19:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1506 states have (on average 1.0703851261620185) internal successors, (1612), 1506 states have internal predecessors, (1612), 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-07-05 10:19:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1612 transitions. [2021-07-05 10:19:10,736 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1612 transitions. Word has length 156 [2021-07-05 10:19:10,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:19:10,737 INFO L442 AbstractCegarLoop]: Abstraction has 1507 states and 1612 transitions. [2021-07-05 10:19:10,737 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-07-05 10:19:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1612 transitions. [2021-07-05 10:19:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-07-05 10:19:10,738 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:19:10,738 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-05 10:19:10,738 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-07-05 10:19:10,739 INFO L374 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:19:10,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:19:10,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1860246650, now seen corresponding path program 1 times [2021-07-05 10:19:10,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:19:10,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767295482] [2021-07-05 10:19:10,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:19:10,739 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:19:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-05 10:19:10,749 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-05 10:19:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-05 10:19:10,759 INFO L224 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-05 10:19:10,792 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-05 10:19:10,792 INFO L639 BasicCegarLoop]: Counterexample is feasible [2021-07-05 10:19:10,792 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-07-05 10:19:10,792 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 10:19:10,793 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (2/2) [2021-07-05 10:19:10,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.07 10:19:10 BoogieIcfgContainer [2021-07-05 10:19:10,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-05 10:19:10,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-05 10:19:10,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-05 10:19:10,961 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-05 10:19:10,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 10:17:46" (3/4) ... [2021-07-05 10:19:10,962 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-07-05 10:19:11,027 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-05 10:19:11,027 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-05 10:19:11,028 INFO L168 Benchmark]: Toolchain (without parser) took 86069.46 ms. Allocated memory was 48.2 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 22.4 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 147.6 MB. Max. memory is 16.1 GB. [2021-07-05 10:19:11,028 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 48.2 MB. Free memory was 29.3 MB in the beginning and 29.2 MB in the end (delta: 32.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-07-05 10:19:11,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.67 ms. Allocated memory was 48.2 MB in the beginning and 65.0 MB in the end (delta: 16.8 MB). Free memory was 22.2 MB in the beginning and 44.2 MB in the end (delta: -22.0 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2021-07-05 10:19:11,028 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.56 ms. Allocated memory is still 65.0 MB. Free memory was 44.0 MB in the beginning and 41.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-05 10:19:11,028 INFO L168 Benchmark]: Boogie Preprocessor took 47.23 ms. Allocated memory is still 65.0 MB. Free memory was 40.8 MB in the beginning and 38.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-05 10:19:11,029 INFO L168 Benchmark]: RCFGBuilder took 694.64 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 38.3 MB in the beginning and 48.3 MB in the end (delta: -10.0 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. [2021-07-05 10:19:11,029 INFO L168 Benchmark]: TraceAbstraction took 84902.92 ms. Allocated memory was 79.7 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 47.8 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 118.8 MB. Max. memory is 16.1 GB. [2021-07-05 10:19:11,029 INFO L168 Benchmark]: Witness Printer took 67.14 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-07-05 10:19:11,029 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.15 ms. Allocated memory is still 48.2 MB. Free memory was 29.3 MB in the beginning and 29.2 MB in the end (delta: 32.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 287.67 ms. Allocated memory was 48.2 MB in the beginning and 65.0 MB in the end (delta: 16.8 MB). Free memory was 22.2 MB in the beginning and 44.2 MB in the end (delta: -22.0 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.56 ms. Allocated memory is still 65.0 MB. Free memory was 44.0 MB in the beginning and 41.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.23 ms. Allocated memory is still 65.0 MB. Free memory was 40.8 MB in the beginning and 38.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 694.64 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 38.3 MB in the beginning and 48.3 MB in the end (delta: -10.0 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 84902.92 ms. Allocated memory was 79.7 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 47.8 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 118.8 MB. Max. memory is 16.1 GB. * Witness Printer took 67.14 ms. Allocated memory is still 2.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int M_E = 2; [L26] int T1_E = 2; [L27] int T2_E = 2; [L28] int E_M = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; [L35] int token ; [L37] int local ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L602] int __retres1 ; [L516] m_i = 1 [L517] t1_i = 1 [L518] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L543] int kernel_st ; [L544] int tmp ; [L545] int tmp___0 ; [L549] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L235] COND TRUE m_i == 1 [L236] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L240] COND TRUE t1_i == 1 [L241] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L245] COND TRUE t2_i == 1 [L246] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L348] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L353] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L358] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L363] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L368] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L373] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L182] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L189] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L208] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L386] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L391] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L396] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L401] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L406] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L411] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L557] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] kernel_st = 1 [L281] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L98] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L134] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L53] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L56] token = __VERIFIER_nondet_int() [L57] local = token [L58] E_1 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L182] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L186] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L189] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L190] COND TRUE E_1 == 1 [L191] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L201] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND TRUE \read(tmp___0) [L438] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L205] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L208] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L209] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L220] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L60] E_1 = 2 [L61] m_pc = 1 [L62] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L98] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L101] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L117] token += 1 [L118] E_2 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L171] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L182] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L186] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L201] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L205] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L209] COND TRUE E_2 == 1 [L210] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L220] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L443] tmp___1 = is_transmit2_triggered() [L445] COND TRUE \read(tmp___1) [L446] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L120] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L109] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L134] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L137] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] token += 1 [L154] E_M = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L171] COND TRUE E_M == 1 [L172] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L182] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L427] tmp = is_master_triggered() [L429] COND TRUE \read(tmp) [L430] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L209] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L156] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L145] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L45] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L67] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L72] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L78] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L80] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L12] reach_error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 225 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 77555.8ms, OverallIterations: 28, TraceHistogramMax: 3, EmptinessCheckTime: 44.5ms, AutomataDifference: 4581.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 68975.8ms, InitialAbstractionConstructionTime: 9.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 10108 SDtfs, 14354 SDslu, 10527 SDs, 0 SdLazy, 868 SolverSat, 269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 596.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 194.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7080occurred in iteration=21, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2988.0ms AutomataMinimizationTime, 28 MinimizatonAttempts, 5917 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 72 LocationsWithAnnotation, 72 PreInvPairs, 1850 NumberOfFragments, 52786 HoareAnnotationTreeSize, 72 FomulaSimplifications, 28072005 FormulaSimplificationTreeSizeReduction, 6397.9ms HoareSimplificationTime, 72 FomulaSimplificationsInter, 37931372 FormulaSimplificationTreeSizeReductionInter, 62514.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 44.9ms SsaConstructionTime, 144.6ms SatisfiabilityAnalysisTime, 523.3ms InterpolantComputationTime, 2474 NumberOfCodeBlocks, 2474 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2446 ConstructedInterpolants, 0 QuantifiedInterpolants, 4453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 352/352 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 225 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 7131.2ms, OverallIterations: 29, TraceHistogramMax: 3, EmptinessCheckTime: 31.7ms, AutomataDifference: 3857.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 10101 SDtfs, 14186 SDslu, 9897 SDs, 0 SdLazy, 864 SolverSat, 269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 535.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 160.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7080occurred in iteration=21, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2575.2ms AutomataMinimizationTime, 28 MinimizatonAttempts, 6545 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 36.0ms SsaConstructionTime, 100.6ms SatisfiabilityAnalysisTime, 352.9ms InterpolantComputationTime, 2743 NumberOfCodeBlocks, 2743 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2558 ConstructedInterpolants, 0 QuantifiedInterpolants, 3823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 352/352 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 - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1) || (((((((((((((((((!(E_M == 1) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((!(E_M == 1) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) || ((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || ((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: (((((((((((((((((((((\result == 0 && __retres1 == 0) && T1_E == M_E) && __retres1 == 0) && token <= local) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && tmp___0 == 0) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && 0 == t2_pc) && local <= token) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && t1_i == 1) && tmp == 0) && m_pc == 0) || (((((((((((((((((((\result == 0 && __retres1 == 0) && T1_E == M_E) && __retres1 == 0) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && tmp___0 == 0) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && !(m_st == 0)) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((!(E_2 == 0) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 601]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1) || ((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && local + 1 <= token) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) || ((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((!(E_M == 1) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((!(E_M == 1) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((((((\result == 0 && __retres1 == 0) && T1_E == M_E) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && !(m_st == 0)) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && t1_i == 1) && tmp == 0) && m_pc == 0) || (((((((((((((((((((\result == 0 && __retres1 == 0) && T1_E == M_E) && token <= local) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && 0 == t2_pc) && local <= token) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == M_E && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && !(m_st == 0)) && 0 == t2_st) && t1_st == 0) && M_E == 2) && t1_i == 1) && m_pc == 0) || ((((((((((((((T1_E == M_E && token <= local) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && 0 == t2_pc) && local <= token) && 0 == t2_st) && t1_st == 0) && M_E == 2) && t1_i == 1) && m_pc == 0) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == M_E && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && !(m_st == 0)) && 0 == t2_st) && t1_st == 0) && M_E == 2) && t1_i == 1) && m_pc == 0) || ((((((((((((((T1_E == M_E && token <= local) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && 0 == t2_pc) && local <= token) && 0 == t2_st) && t1_st == 0) && M_E == 2) && t1_i == 1) && m_pc == 0) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && local + 1 <= token)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(E_M == 1) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) || (((((((((((((((((((!(E_M == 1) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && !(m_st == 0)) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && t1_i == 1) && m_pc == 0) || ((((((((((((((((T1_E == M_E && token <= local) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && 0 == t2_pc) && local <= token) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && t1_i == 1) && m_pc == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: ((((((((((((((((((__retres1 == 0 && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((!(E_1 == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((!(E_1 == 1) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: (((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) || (((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && local + 1 <= token)) || ((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && local + 1 <= token) || ((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(E_M == 1) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && __retres1 == 0) && T1_E == M_E) && __retres1 == 0) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && tmp___0 == 0) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && !(m_st == 0)) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && T1_E == M_E) && __retres1 == 0) && token <= local) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && tmp___0 == 0) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && 0 == t2_pc) && local <= token) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == M_E && token <= local) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && 0 == t2_pc) && local <= token) && 0 == t2_st) && t1_st == 0) && M_E == 2) && t1_i == 1) && m_pc == 0 - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) || (((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) || (((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(E_1 == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) || (((((((((((((((((((!(E_1 == 1) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((__retres1 == 0 && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) || (((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && m_pc == 0)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1)) || (((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && m_pc == 0)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 478]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || ((((((((((((((((((!(E_1 == 1) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((!(E_1 == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((!(E_2 == 0) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && m_pc == 0) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && m_pc == 0) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && local + 1 <= token) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(E_M == 1) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((!(E_M == 1) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1)) || (((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((__retres1 == 0 && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) || ((((((((((((((((((!(E_1 == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((!(E_1 == 1) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 523]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1) && m_pc == 0)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) && m_pc == 0) - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == M_E && token <= local) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && 0 == t2_pc) && local <= token) && 0 == t2_st) && t1_st == 0) && M_E == 2) && t1_i == 1) && m_pc == 0 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((((((((((((((((__retres1 == 0 && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) || ((((((((((((((((__retres1 == 0 && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((!(E_2 == 0) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((__retres1 == 0 && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((__retres1 == 0 && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1) && !(0 == t2_st)) || (((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) || (((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((!(E_M == 1) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && local + 1 <= token) || ((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0) || ((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || ((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1)) || ((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0)) || ((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1) || ((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((!(E_M == 1) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((!(E_M == 1) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && m_pc == 0) || (((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || ((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && m_pc == 0) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((((((((((((((__retres1 == 0 && T1_E == M_E) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && !(m_st == 0)) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && t1_i == 1) && tmp == 0) && m_pc == 0) || ((((((((((((((((((__retres1 == 0 && T1_E == M_E) && token <= local) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && 0 == t2_pc) && local <= token) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((((((((((((!(E_2 == 0) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && m_pc == 0) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && m_pc == 0)) || ((((((((((((((((((!(E_1 == 1) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((!(E_1 == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((\result == 0 && __retres1 == 0) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token) || ((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && local + 1 <= token) || (((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1)) || (((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && m_pc == 0) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && tmp___1 == 0) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((\result == 0 && __retres1 == 0) && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && tmp___0 == 0) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && tmp___1 == 0) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && tmp___1 == 0) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == M_E && token <= local) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && 0 == t2_pc) && local <= token) && 0 == t2_st) && t1_st == 0) && __retres1 == 0) && M_E == 2) && t1_i == 1) && m_pc == 0) || (((((((((((((T1_E == M_E && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && T2_E == M_E) && t2_i == 1) && E_M == M_E) && !(m_st == 0)) && 0 == t2_st) && t1_st == 0) && __retres1 == 0) && M_E == 2) && t1_i == 1) && m_pc == 0) - InvariantResult [Line: 542]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((\result == 0 && __retres1 == 0) && T1_E == M_E) && __retres1 == 0) && token <= local) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && tmp___0 == 0) && T2_E == M_E) && t2_i == 1) && tmp___1 == 0) && E_M == M_E) && 0 == t2_pc) && local <= token) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) || (((((((((((((((((((((\result == 0 && __retres1 == 0) && T1_E == M_E) && __retres1 == 0) && E_2 == M_E) && m_pc == t1_pc) && E_1 == M_E) && tmp___0 == 0) && T2_E == M_E) && t2_i == 1) && tmp___1 == 0) && E_M == M_E) && !(m_st == 0)) && 0 == t2_st) && t1_st == 0) && \result == 0) && __retres1 == 0) && M_E == 2) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((!(E_M == 1) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0) || (((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && token < 3 + local) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || ((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || ((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t1_i == 1)) || (((((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && local + 1 <= token)) || (((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && __retres1 == 0) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && __retres1 == 0) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && \result == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(E_M == 1) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1) || (((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && token < 3 + local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 2 + local <= token) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((!(E_M == 1) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || ((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && !(E_2 == 1)) && !(m_st == 0)) && local <= token) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || (((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && token <= local) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(E_2 == 1)) && local <= token) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t1_i == 1) && tmp == 0) && m_pc == 0)) || ((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st))) || (((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && m_pc == 1) && 0 == t2_pc) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || ((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && 0 == t2_pc) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && 0 == t2_st) && !(T1_E == 0)) && !(T2_E == 1)) && t1_i == 1)) || (((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(t1_pc == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && !(E_1 == 0)) && t2_i == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(E_M == 0)) && !(T1_E == 0)) && \result == 0) && !(T2_E == 1)) && __retres1 == 0) && t2_pc == 1) && t1_i == 1) && !(0 == t2_st)) && tmp == 0) && m_pc == 0)) || (((((((((((((((((((__retres1 == 0 && !(E_M == 1)) && !(E_1 == 1)) && !(E_2 == 0)) && !(T2_E == 0)) && !(T1_E == 1)) && token <= local + 1) && !(E_1 == 0)) && t1_pc == 1) && t2_i == 1) && m_pc == 1) && !(t1_st == 0)) && !(E_2 == 1)) && !(m_st == 0)) && !(E_M == 0)) && !(T1_E == 0)) && !(T2_E == 1)) && t2_pc == 1) && t1_i == 1) && local + 1 <= token) RESULT: Ultimate proved your program to be incorrect! [2021-07-05 10:19:11,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...