./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4db1032dfd29fb54619de039c3f4db8a50fc2148f96c9b60d6f0bd84d60ae635 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 04:50:32,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:50:32,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:50:32,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:50:32,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:50:32,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:50:32,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:50:32,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:50:32,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:50:32,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:50:32,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:50:32,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:50:32,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:50:32,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:50:32,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:50:32,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:50:32,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:50:32,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:50:32,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:50:32,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:50:32,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:50:32,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:50:32,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:50:32,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:50:32,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:50:32,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:50:32,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:50:32,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:50:32,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:50:32,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:50:32,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:50:32,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:50:32,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:50:32,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:50:32,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:50:32,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:50:32,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:50:32,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:50:32,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:50:32,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:50:32,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:50:32,512 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 04:50:32,540 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:50:32,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:50:32,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:50:32,542 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 04:50:32,542 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 04:50:32,542 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 04:50:32,542 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 04:50:32,542 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 04:50:32,543 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 04:50:32,543 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 04:50:32,543 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 04:50:32,543 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 04:50:32,544 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 04:50:32,544 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 04:50:32,544 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 04:50:32,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:50:32,545 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:50:32,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 04:50:32,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:50:32,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:50:32,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 04:50:32,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:50:32,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 04:50:32,546 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 04:50:32,547 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:50:32,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 04:50:32,547 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:50:32,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 04:50:32,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:50:32,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 04:50:32,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:50:32,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:50:32,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:50:32,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 04:50:32,549 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 04:50:32,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 04:50:32,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 04:50:32,549 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 04:50:32,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 04:50:32,550 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG 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 -> Taipan 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 -> 4db1032dfd29fb54619de039c3f4db8a50fc2148f96c9b60d6f0bd84d60ae635 [2021-10-29 04:50:32,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:50:32,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:50:32,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:50:32,830 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:50:32,831 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:50:32,832 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2021-10-29 04:50:32,943 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/data/02ea1d8ff/5a65c097631141c18ac3f910723e8107/FLAG669179a62 [2021-10-29 04:50:33,459 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:50:33,460 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2021-10-29 04:50:33,471 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/data/02ea1d8ff/5a65c097631141c18ac3f910723e8107/FLAG669179a62 [2021-10-29 04:50:33,791 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/data/02ea1d8ff/5a65c097631141c18ac3f910723e8107 [2021-10-29 04:50:33,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:50:33,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:50:33,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:50:33,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:50:33,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:50:33,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:50:33" (1/1) ... [2021-10-29 04:50:33,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d50f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:33, skipping insertion in model container [2021-10-29 04:50:33,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:50:33" (1/1) ... [2021-10-29 04:50:33,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:50:33,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:50:34,073 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/sv-benchmarks/c/systemc/token_ring.03.cil-2.c[366,379] [2021-10-29 04:50:34,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:50:34,161 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:50:34,174 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/sv-benchmarks/c/systemc/token_ring.03.cil-2.c[366,379] [2021-10-29 04:50:34,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:50:34,230 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:50:34,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34 WrapperNode [2021-10-29 04:50:34,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:50:34,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:50:34,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:50:34,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:50:34,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34" (1/1) ... [2021-10-29 04:50:34,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34" (1/1) ... [2021-10-29 04:50:34,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:50:34,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:50:34,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:50:34,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:50:34,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34" (1/1) ... [2021-10-29 04:50:34,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34" (1/1) ... [2021-10-29 04:50:34,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34" (1/1) ... [2021-10-29 04:50:34,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34" (1/1) ... [2021-10-29 04:50:34,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34" (1/1) ... [2021-10-29 04:50:34,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34" (1/1) ... [2021-10-29 04:50:34,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34" (1/1) ... [2021-10-29 04:50:34,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:50:34,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:50:34,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:50:34,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:50:34,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34" (1/1) ... [2021-10-29 04:50:34,371 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:50:34,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:50:34,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 04:50:34,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 04:50:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:50:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 04:50:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:50:34,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:50:36,230 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:50:36,231 INFO L299 CfgBuilder]: Removed 130 assume(true) statements. [2021-10-29 04:50:36,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:36 BoogieIcfgContainer [2021-10-29 04:50:36,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:50:36,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 04:50:36,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 04:50:36,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 04:50:36,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 04:50:33" (1/3) ... [2021-10-29 04:50:36,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e76f61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:50:36, skipping insertion in model container [2021-10-29 04:50:36,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:34" (2/3) ... [2021-10-29 04:50:36,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e76f61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:50:36, skipping insertion in model container [2021-10-29 04:50:36,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:36" (3/3) ... [2021-10-29 04:50:36,246 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2021-10-29 04:50:36,256 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 04:50:36,256 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-29 04:50:36,328 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 04:50:36,337 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 04:50:36,337 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-29 04:50:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 144 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 04:50:36,368 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:36,369 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:36,369 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:36,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1914888244, now seen corresponding path program 1 times [2021-10-29 04:50:36,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:36,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227522184] [2021-10-29 04:50:36,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:36,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:36,599 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:36,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227522184] [2021-10-29 04:50:36,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227522184] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:36,601 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:36,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:50:36,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070228254] [2021-10-29 04:50:36,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:36,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:36,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:36,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:36,632 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 144 states have internal predecessors, (223), 0 states have call successors, (0), 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 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:36,782 INFO L93 Difference]: Finished difference Result 405 states and 621 transitions. [2021-10-29 04:50:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:36,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-29 04:50:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:36,806 INFO L225 Difference]: With dead ends: 405 [2021-10-29 04:50:36,807 INFO L226 Difference]: Without dead ends: 258 [2021-10-29 04:50:36,813 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-29 04:50:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 244. [2021-10-29 04:50:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 243 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 362 transitions. [2021-10-29 04:50:36,899 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 362 transitions. Word has length 22 [2021-10-29 04:50:36,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:36,900 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 362 transitions. [2021-10-29 04:50:36,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 362 transitions. [2021-10-29 04:50:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-29 04:50:36,904 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:36,904 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:36,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 04:50:36,905 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1462365306, now seen corresponding path program 1 times [2021-10-29 04:50:36,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:36,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665345933] [2021-10-29 04:50:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:36,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-29 04:50:37,040 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:37,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665345933] [2021-10-29 04:50:37,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665345933] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:37,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:37,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:37,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296909834] [2021-10-29 04:50:37,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:37,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:37,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:37,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:37,045 INFO L87 Difference]: Start difference. First operand 244 states and 362 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:37,223 INFO L93 Difference]: Finished difference Result 774 states and 1140 transitions. [2021-10-29 04:50:37,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:37,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-29 04:50:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:37,232 INFO L225 Difference]: With dead ends: 774 [2021-10-29 04:50:37,232 INFO L226 Difference]: Without dead ends: 539 [2021-10-29 04:50:37,238 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-10-29 04:50:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 427. [2021-10-29 04:50:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.460093896713615) internal successors, (622), 426 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 622 transitions. [2021-10-29 04:50:37,329 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 622 transitions. Word has length 43 [2021-10-29 04:50:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:37,329 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 622 transitions. [2021-10-29 04:50:37,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 622 transitions. [2021-10-29 04:50:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-29 04:50:37,334 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:37,334 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:37,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 04:50:37,335 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:37,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:37,336 INFO L85 PathProgramCache]: Analyzing trace with hash -302451303, now seen corresponding path program 1 times [2021-10-29 04:50:37,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:37,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729863260] [2021-10-29 04:50:37,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:37,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-29 04:50:37,418 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:37,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729863260] [2021-10-29 04:50:37,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729863260] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:37,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:37,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:37,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015620071] [2021-10-29 04:50:37,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:37,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:37,421 INFO L87 Difference]: Start difference. First operand 427 states and 622 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:37,567 INFO L93 Difference]: Finished difference Result 1358 states and 1963 transitions. [2021-10-29 04:50:37,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:37,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-29 04:50:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:37,575 INFO L225 Difference]: With dead ends: 1358 [2021-10-29 04:50:37,576 INFO L226 Difference]: Without dead ends: 943 [2021-10-29 04:50:37,578 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-10-29 04:50:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 756. [2021-10-29 04:50:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.4317880794701987) internal successors, (1081), 755 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1081 transitions. [2021-10-29 04:50:37,635 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1081 transitions. Word has length 43 [2021-10-29 04:50:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:37,637 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1081 transitions. [2021-10-29 04:50:37,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1081 transitions. [2021-10-29 04:50:37,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-29 04:50:37,644 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:37,645 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:37,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 04:50:37,646 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:37,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1411597113, now seen corresponding path program 1 times [2021-10-29 04:50:37,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:37,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144459453] [2021-10-29 04:50:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:37,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:37,786 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:37,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144459453] [2021-10-29 04:50:37,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144459453] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:37,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:37,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:37,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623728734] [2021-10-29 04:50:37,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:37,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:37,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:37,797 INFO L87 Difference]: Start difference. First operand 756 states and 1081 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:37,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:37,991 INFO L93 Difference]: Finished difference Result 2486 states and 3517 transitions. [2021-10-29 04:50:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:37,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-29 04:50:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:38,002 INFO L225 Difference]: With dead ends: 2486 [2021-10-29 04:50:38,003 INFO L226 Difference]: Without dead ends: 1735 [2021-10-29 04:50:38,006 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2021-10-29 04:50:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1343. [2021-10-29 04:50:38,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1342 states have (on average 1.405365126676602) internal successors, (1886), 1342 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1886 transitions. [2021-10-29 04:50:38,081 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1886 transitions. Word has length 43 [2021-10-29 04:50:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:38,082 INFO L470 AbstractCegarLoop]: Abstraction has 1343 states and 1886 transitions. [2021-10-29 04:50:38,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1886 transitions. [2021-10-29 04:50:38,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-29 04:50:38,088 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:38,088 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:38,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 04:50:38,089 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash 2072930904, now seen corresponding path program 1 times [2021-10-29 04:50:38,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:38,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890877726] [2021-10-29 04:50:38,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:38,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:38,242 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:38,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890877726] [2021-10-29 04:50:38,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890877726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:38,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:38,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:38,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75749402] [2021-10-29 04:50:38,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:38,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:38,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:38,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:38,245 INFO L87 Difference]: Start difference. First operand 1343 states and 1886 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:38,454 INFO L93 Difference]: Finished difference Result 4577 states and 6469 transitions. [2021-10-29 04:50:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:38,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-10-29 04:50:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:38,474 INFO L225 Difference]: With dead ends: 4577 [2021-10-29 04:50:38,475 INFO L226 Difference]: Without dead ends: 3247 [2021-10-29 04:50:38,477 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:38,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2021-10-29 04:50:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2499. [2021-10-29 04:50:38,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2499 states, 2498 states have (on average 1.3971176941553243) internal successors, (3490), 2498 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 3490 transitions. [2021-10-29 04:50:38,639 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 3490 transitions. Word has length 43 [2021-10-29 04:50:38,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:38,639 INFO L470 AbstractCegarLoop]: Abstraction has 2499 states and 3490 transitions. [2021-10-29 04:50:38,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 3490 transitions. [2021-10-29 04:50:38,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-29 04:50:38,643 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:38,643 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:38,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 04:50:38,643 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:38,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:38,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1241637347, now seen corresponding path program 1 times [2021-10-29 04:50:38,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:38,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944471526] [2021-10-29 04:50:38,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:38,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:38,690 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:38,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944471526] [2021-10-29 04:50:38,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944471526] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:38,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:38,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:38,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806289692] [2021-10-29 04:50:38,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:38,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:38,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:38,693 INFO L87 Difference]: Start difference. First operand 2499 states and 3490 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:38,871 INFO L93 Difference]: Finished difference Result 4321 states and 6167 transitions. [2021-10-29 04:50:38,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:38,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2021-10-29 04:50:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:38,889 INFO L225 Difference]: With dead ends: 4321 [2021-10-29 04:50:38,889 INFO L226 Difference]: Without dead ends: 2895 [2021-10-29 04:50:38,893 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2021-10-29 04:50:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2735. [2021-10-29 04:50:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2734 states have (on average 1.4198975859546452) internal successors, (3882), 2734 states have internal predecessors, (3882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 3882 transitions. [2021-10-29 04:50:39,034 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 3882 transitions. Word has length 44 [2021-10-29 04:50:39,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:39,035 INFO L470 AbstractCegarLoop]: Abstraction has 2735 states and 3882 transitions. [2021-10-29 04:50:39,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 3882 transitions. [2021-10-29 04:50:39,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-29 04:50:39,043 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:39,044 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-10-29 04:50:39,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 04:50:39,044 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:39,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:39,045 INFO L85 PathProgramCache]: Analyzing trace with hash -585502559, now seen corresponding path program 1 times [2021-10-29 04:50:39,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:39,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166671659] [2021-10-29 04:50:39,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:39,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:39,137 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:39,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166671659] [2021-10-29 04:50:39,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166671659] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:39,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:39,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:39,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317818886] [2021-10-29 04:50:39,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:39,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:39,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:39,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:39,140 INFO L87 Difference]: Start difference. First operand 2735 states and 3882 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:39,318 INFO L93 Difference]: Finished difference Result 4597 states and 6559 transitions. [2021-10-29 04:50:39,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:39,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-29 04:50:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:39,335 INFO L225 Difference]: With dead ends: 4597 [2021-10-29 04:50:39,335 INFO L226 Difference]: Without dead ends: 2935 [2021-10-29 04:50:39,339 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2021-10-29 04:50:39,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2735. [2021-10-29 04:50:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2734 states have (on average 1.3833211411850768) internal successors, (3782), 2734 states have internal predecessors, (3782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 3782 transitions. [2021-10-29 04:50:39,518 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 3782 transitions. Word has length 63 [2021-10-29 04:50:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:39,518 INFO L470 AbstractCegarLoop]: Abstraction has 2735 states and 3782 transitions. [2021-10-29 04:50:39,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 3782 transitions. [2021-10-29 04:50:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-29 04:50:39,525 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:39,526 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-10-29 04:50:39,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 04:50:39,526 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1004892418, now seen corresponding path program 1 times [2021-10-29 04:50:39,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:39,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857591209] [2021-10-29 04:50:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:39,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:50:39,603 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:39,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857591209] [2021-10-29 04:50:39,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857591209] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:39,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:39,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:39,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666194738] [2021-10-29 04:50:39,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:39,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:39,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:39,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:39,606 INFO L87 Difference]: Start difference. First operand 2735 states and 3782 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:39,979 INFO L93 Difference]: Finished difference Result 9605 states and 13297 transitions. [2021-10-29 04:50:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-29 04:50:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:40,018 INFO L225 Difference]: With dead ends: 9605 [2021-10-29 04:50:40,019 INFO L226 Difference]: Without dead ends: 6883 [2021-10-29 04:50:40,025 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:40,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6883 states. [2021-10-29 04:50:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6883 to 5055. [2021-10-29 04:50:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5055 states, 5054 states have (on average 1.367233874159082) internal successors, (6910), 5054 states have internal predecessors, (6910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 6910 transitions. [2021-10-29 04:50:40,314 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 6910 transitions. Word has length 63 [2021-10-29 04:50:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:40,314 INFO L470 AbstractCegarLoop]: Abstraction has 5055 states and 6910 transitions. [2021-10-29 04:50:40,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 6910 transitions. [2021-10-29 04:50:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-29 04:50:40,325 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:40,325 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:40,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 04:50:40,326 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:40,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:40,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1174872423, now seen corresponding path program 1 times [2021-10-29 04:50:40,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:40,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618842530] [2021-10-29 04:50:40,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:40,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:50:40,383 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:40,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618842530] [2021-10-29 04:50:40,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618842530] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:40,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:40,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:40,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621125075] [2021-10-29 04:50:40,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:40,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:40,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:40,386 INFO L87 Difference]: Start difference. First operand 5055 states and 6910 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:41,032 INFO L93 Difference]: Finished difference Result 17409 states and 23781 transitions. [2021-10-29 04:50:41,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:41,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-29 04:50:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:41,099 INFO L225 Difference]: With dead ends: 17409 [2021-10-29 04:50:41,099 INFO L226 Difference]: Without dead ends: 12367 [2021-10-29 04:50:41,110 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:50:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12367 states. [2021-10-29 04:50:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12367 to 9295. [2021-10-29 04:50:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9295 states, 9294 states have (on average 1.347751237357435) internal successors, (12526), 9294 states have internal predecessors, (12526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9295 states to 9295 states and 12526 transitions. [2021-10-29 04:50:41,684 INFO L78 Accepts]: Start accepts. Automaton has 9295 states and 12526 transitions. Word has length 64 [2021-10-29 04:50:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:41,684 INFO L470 AbstractCegarLoop]: Abstraction has 9295 states and 12526 transitions. [2021-10-29 04:50:41,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 9295 states and 12526 transitions. [2021-10-29 04:50:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-29 04:50:41,705 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:41,705 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:41,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 04:50:41,705 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:41,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1845858571, now seen corresponding path program 1 times [2021-10-29 04:50:41,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:41,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139077512] [2021-10-29 04:50:41,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:41,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-29 04:50:41,783 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:41,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139077512] [2021-10-29 04:50:41,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139077512] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:50:41,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779680245] [2021-10-29 04:50:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:41,784 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:50:41,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:50:41,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:50:41,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-29 04:50:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:41,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-29 04:50:41,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:50:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:42,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:50:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:42,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779680245] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:42,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 04:50:42,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [4] total 10 [2021-10-29 04:50:42,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005978744] [2021-10-29 04:50:42,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 04:50:42,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:42,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 04:50:42,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-29 04:50:42,522 INFO L87 Difference]: Start difference. First operand 9295 states and 12526 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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-10-29 04:50:43,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:43,962 INFO L93 Difference]: Finished difference Result 25737 states and 35448 transitions. [2021-10-29 04:50:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-29 04:50:43,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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 65 [2021-10-29 04:50:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:44,012 INFO L225 Difference]: With dead ends: 25737 [2021-10-29 04:50:44,012 INFO L226 Difference]: Without dead ends: 16455 [2021-10-29 04:50:44,026 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2021-10-29 04:50:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16455 states. [2021-10-29 04:50:44,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16455 to 10124. [2021-10-29 04:50:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10124 states, 10123 states have (on average 1.3684678455003458) internal successors, (13853), 10123 states have internal predecessors, (13853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10124 states to 10124 states and 13853 transitions. [2021-10-29 04:50:44,785 INFO L78 Accepts]: Start accepts. Automaton has 10124 states and 13853 transitions. Word has length 65 [2021-10-29 04:50:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:44,786 INFO L470 AbstractCegarLoop]: Abstraction has 10124 states and 13853 transitions. [2021-10-29 04:50:44,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 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-10-29 04:50:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 10124 states and 13853 transitions. [2021-10-29 04:50:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-29 04:50:44,811 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:44,811 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-10-29 04:50:44,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-29 04:50:45,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-29 04:50:45,039 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1769743795, now seen corresponding path program 1 times [2021-10-29 04:50:45,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:45,040 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312286460] [2021-10-29 04:50:45,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:45,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:45,106 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:45,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312286460] [2021-10-29 04:50:45,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312286460] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:45,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:45,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:45,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716710579] [2021-10-29 04:50:45,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:45,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:45,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:45,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:45,109 INFO L87 Difference]: Start difference. First operand 10124 states and 13853 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:45,662 INFO L93 Difference]: Finished difference Result 20234 states and 27692 transitions. [2021-10-29 04:50:45,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:45,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-10-29 04:50:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:45,687 INFO L225 Difference]: With dead ends: 20234 [2021-10-29 04:50:45,688 INFO L226 Difference]: Without dead ends: 10124 [2021-10-29 04:50:45,701 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10124 states. [2021-10-29 04:50:46,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10124 to 10124. [2021-10-29 04:50:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10124 states, 10123 states have (on average 1.3512792650400078) internal successors, (13679), 10123 states have internal predecessors, (13679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10124 states to 10124 states and 13679 transitions. [2021-10-29 04:50:46,253 INFO L78 Accepts]: Start accepts. Automaton has 10124 states and 13679 transitions. Word has length 67 [2021-10-29 04:50:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:46,254 INFO L470 AbstractCegarLoop]: Abstraction has 10124 states and 13679 transitions. [2021-10-29 04:50:46,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:46,255 INFO L276 IsEmpty]: Start isEmpty. Operand 10124 states and 13679 transitions. [2021-10-29 04:50:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-29 04:50:46,279 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:46,279 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-10-29 04:50:46,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 04:50:46,279 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:46,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1551734542, now seen corresponding path program 1 times [2021-10-29 04:50:46,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:46,280 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316932595] [2021-10-29 04:50:46,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:46,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:46,408 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:46,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316932595] [2021-10-29 04:50:46,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316932595] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:46,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:46,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:46,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875445668] [2021-10-29 04:50:46,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:46,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:46,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:46,414 INFO L87 Difference]: Start difference. First operand 10124 states and 13679 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:46,840 INFO L93 Difference]: Finished difference Result 16851 states and 22836 transitions. [2021-10-29 04:50:46,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:46,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-10-29 04:50:46,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:46,859 INFO L225 Difference]: With dead ends: 16851 [2021-10-29 04:50:46,859 INFO L226 Difference]: Without dead ends: 6741 [2021-10-29 04:50:46,873 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6741 states. [2021-10-29 04:50:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6741 to 6670. [2021-10-29 04:50:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6670 states, 6669 states have (on average 1.314589893537262) internal successors, (8767), 6669 states have internal predecessors, (8767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 8767 transitions. [2021-10-29 04:50:47,196 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 8767 transitions. Word has length 67 [2021-10-29 04:50:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:47,197 INFO L470 AbstractCegarLoop]: Abstraction has 6670 states and 8767 transitions. [2021-10-29 04:50:47,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 8767 transitions. [2021-10-29 04:50:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-29 04:50:47,209 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:47,209 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-10-29 04:50:47,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 04:50:47,210 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:47,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1699998803, now seen corresponding path program 1 times [2021-10-29 04:50:47,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:47,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072175590] [2021-10-29 04:50:47,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:47,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:47,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:47,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072175590] [2021-10-29 04:50:47,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072175590] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:50:47,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244937432] [2021-10-29 04:50:47,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:47,342 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:50:47,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:50:47,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:50:47,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-29 04:50:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:47,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-29 04:50:47,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:50:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:47,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:50:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:48,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244937432] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:48,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 04:50:48,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [4] total 12 [2021-10-29 04:50:48,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955553629] [2021-10-29 04:50:48,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 04:50:48,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:48,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 04:50:48,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-29 04:50:48,080 INFO L87 Difference]: Start difference. First operand 6670 states and 8767 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:49,181 INFO L93 Difference]: Finished difference Result 15807 states and 21033 transitions. [2021-10-29 04:50:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-29 04:50:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 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 68 [2021-10-29 04:50:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:49,208 INFO L225 Difference]: With dead ends: 15807 [2021-10-29 04:50:49,208 INFO L226 Difference]: Without dead ends: 10406 [2021-10-29 04:50:49,220 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2021-10-29 04:50:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10406 states. [2021-10-29 04:50:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10406 to 6053. [2021-10-29 04:50:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6053 states, 6052 states have (on average 1.3319563780568406) internal successors, (8061), 6052 states have internal predecessors, (8061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6053 states to 6053 states and 8061 transitions. [2021-10-29 04:50:49,769 INFO L78 Accepts]: Start accepts. Automaton has 6053 states and 8061 transitions. Word has length 68 [2021-10-29 04:50:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:49,770 INFO L470 AbstractCegarLoop]: Abstraction has 6053 states and 8061 transitions. [2021-10-29 04:50:49,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 6053 states and 8061 transitions. [2021-10-29 04:50:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-29 04:50:49,783 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:49,784 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-10-29 04:50:49,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-29 04:50:50,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:50:50,011 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:50,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1144230019, now seen corresponding path program 1 times [2021-10-29 04:50:50,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:50,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625377745] [2021-10-29 04:50:50,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:50,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:50,089 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:50,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625377745] [2021-10-29 04:50:50,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625377745] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:50:50,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843195604] [2021-10-29 04:50:50,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:50,090 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:50:50,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:50:50,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:50:50,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-29 04:50:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:50,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-29 04:50:50,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:50:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:50,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:50:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:50,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843195604] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:50,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 04:50:50,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [4] total 13 [2021-10-29 04:50:50,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726601982] [2021-10-29 04:50:50,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-29 04:50:50,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:50,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-29 04:50:50,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-29 04:50:50,829 INFO L87 Difference]: Start difference. First operand 6053 states and 8061 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:52,209 INFO L93 Difference]: Finished difference Result 13608 states and 18150 transitions. [2021-10-29 04:50:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-29 04:50:52,209 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-10-29 04:50:52,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:52,233 INFO L225 Difference]: With dead ends: 13608 [2021-10-29 04:50:52,233 INFO L226 Difference]: Without dead ends: 9672 [2021-10-29 04:50:52,244 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2021-10-29 04:50:52,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9672 states. [2021-10-29 04:50:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9672 to 5812. [2021-10-29 04:50:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5812 states, 5811 states have (on average 1.336258819480296) internal successors, (7765), 5811 states have internal predecessors, (7765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5812 states to 5812 states and 7765 transitions. [2021-10-29 04:50:52,760 INFO L78 Accepts]: Start accepts. Automaton has 5812 states and 7765 transitions. Word has length 70 [2021-10-29 04:50:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:52,760 INFO L470 AbstractCegarLoop]: Abstraction has 5812 states and 7765 transitions. [2021-10-29 04:50:52,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 5812 states and 7765 transitions. [2021-10-29 04:50:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-29 04:50:52,771 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:52,771 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 04:50:52,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-29 04:50:52,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-29 04:50:52,999 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1354715054, now seen corresponding path program 1 times [2021-10-29 04:50:52,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:53,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141893852] [2021-10-29 04:50:53,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:53,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:53,111 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:53,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141893852] [2021-10-29 04:50:53,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141893852] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:50:53,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503159597] [2021-10-29 04:50:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:53,112 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:50:53,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:50:53,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:50:53,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-29 04:50:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:53,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-29 04:50:53,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:50:53,590 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:53,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:50:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:53,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503159597] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:53,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 04:50:53,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-29 04:50:53,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701664412] [2021-10-29 04:50:53,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:53,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:53,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:50:53,800 INFO L87 Difference]: Start difference. First operand 5812 states and 7765 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-10-29 04:50:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:54,334 INFO L93 Difference]: Finished difference Result 12669 states and 16932 transitions. [2021-10-29 04:50:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:54,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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 72 [2021-10-29 04:50:54,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:54,355 INFO L225 Difference]: With dead ends: 12669 [2021-10-29 04:50:54,355 INFO L226 Difference]: Without dead ends: 6898 [2021-10-29 04:50:54,367 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:50:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2021-10-29 04:50:54,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 6155. [2021-10-29 04:50:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6155 states, 6154 states have (on average 1.3414039649008775) internal successors, (8255), 6154 states have internal predecessors, (8255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6155 states to 6155 states and 8255 transitions. [2021-10-29 04:50:54,694 INFO L78 Accepts]: Start accepts. Automaton has 6155 states and 8255 transitions. Word has length 72 [2021-10-29 04:50:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:54,694 INFO L470 AbstractCegarLoop]: Abstraction has 6155 states and 8255 transitions. [2021-10-29 04:50:54,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-10-29 04:50:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 6155 states and 8255 transitions. [2021-10-29 04:50:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-29 04:50:54,707 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:54,708 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 04:50:54,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-29 04:50:54,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-29 04:50:54,935 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:54,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash 178836382, now seen corresponding path program 1 times [2021-10-29 04:50:54,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:54,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808023577] [2021-10-29 04:50:54,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:54,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:54,989 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:54,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808023577] [2021-10-29 04:50:54,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808023577] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:50:54,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378196855] [2021-10-29 04:50:54,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:54,990 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:50:54,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:50:54,991 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:50:55,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-29 04:50:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:55,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-29 04:50:55,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:50:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:55,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:50:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:55,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378196855] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:55,627 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 04:50:55,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-29 04:50:55,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167239023] [2021-10-29 04:50:55,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:50:55,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:55,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:50:55,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:50:55,629 INFO L87 Difference]: Start difference. First operand 6155 states and 8255 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-10-29 04:50:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:56,121 INFO L93 Difference]: Finished difference Result 11832 states and 15909 transitions. [2021-10-29 04:50:56,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:50:56,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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 72 [2021-10-29 04:50:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:56,134 INFO L225 Difference]: With dead ends: 11832 [2021-10-29 04:50:56,134 INFO L226 Difference]: Without dead ends: 6705 [2021-10-29 04:50:56,142 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:50:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2021-10-29 04:50:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 6181. [2021-10-29 04:50:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6181 states, 6180 states have (on average 1.3435275080906148) internal successors, (8303), 6180 states have internal predecessors, (8303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6181 states to 6181 states and 8303 transitions. [2021-10-29 04:50:56,521 INFO L78 Accepts]: Start accepts. Automaton has 6181 states and 8303 transitions. Word has length 72 [2021-10-29 04:50:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:56,521 INFO L470 AbstractCegarLoop]: Abstraction has 6181 states and 8303 transitions. [2021-10-29 04:50:56,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-10-29 04:50:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 6181 states and 8303 transitions. [2021-10-29 04:50:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-29 04:50:56,533 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:56,533 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-10-29 04:50:56,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-29 04:50:56,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-29 04:50:56,757 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1711425730, now seen corresponding path program 1 times [2021-10-29 04:50:56,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:56,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786482677] [2021-10-29 04:50:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:56,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:56,799 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:56,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786482677] [2021-10-29 04:50:56,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786482677] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:56,800 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:56,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:56,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997951471] [2021-10-29 04:50:56,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:56,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:56,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:56,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:56,801 INFO L87 Difference]: Start difference. First operand 6181 states and 8303 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:57,174 INFO L93 Difference]: Finished difference Result 11127 states and 14982 transitions. [2021-10-29 04:50:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:57,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-10-29 04:50:57,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:57,182 INFO L225 Difference]: With dead ends: 11127 [2021-10-29 04:50:57,182 INFO L226 Difference]: Without dead ends: 5040 [2021-10-29 04:50:57,188 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5040 states. [2021-10-29 04:50:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5040 to 4956. [2021-10-29 04:50:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4956 states, 4955 states have (on average 1.3089808274470232) internal successors, (6486), 4955 states have internal predecessors, (6486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 6486 transitions. [2021-10-29 04:50:57,472 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 6486 transitions. Word has length 72 [2021-10-29 04:50:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:57,473 INFO L470 AbstractCegarLoop]: Abstraction has 4956 states and 6486 transitions. [2021-10-29 04:50:57,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 6486 transitions. [2021-10-29 04:50:57,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-29 04:50:57,483 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:57,483 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-10-29 04:50:57,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 04:50:57,483 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1513117887, now seen corresponding path program 1 times [2021-10-29 04:50:57,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:57,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182852795] [2021-10-29 04:50:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:57,485 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:50:57,550 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:57,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182852795] [2021-10-29 04:50:57,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182852795] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:50:57,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322348126] [2021-10-29 04:50:57,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:57,551 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:50:57,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:50:57,552 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:50:57,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-29 04:50:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:57,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-29 04:50:57,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:50:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:50:58,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:50:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:50:58,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322348126] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:58,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 04:50:58,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [4] total 8 [2021-10-29 04:50:58,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488180485] [2021-10-29 04:50:58,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:50:58,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:58,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:50:58,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:50:58,547 INFO L87 Difference]: Start difference. First operand 4956 states and 6486 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:58,933 INFO L93 Difference]: Finished difference Result 8519 states and 11132 transitions. [2021-10-29 04:50:58,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:50:58,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 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 72 [2021-10-29 04:50:58,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:58,941 INFO L225 Difference]: With dead ends: 8519 [2021-10-29 04:50:58,941 INFO L226 Difference]: Without dead ends: 5199 [2021-10-29 04:50:58,944 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:50:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2021-10-29 04:50:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 4956. [2021-10-29 04:50:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4956 states, 4955 states have (on average 1.2952573158425833) internal successors, (6418), 4955 states have internal predecessors, (6418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 6418 transitions. [2021-10-29 04:50:59,288 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 6418 transitions. Word has length 72 [2021-10-29 04:50:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:59,288 INFO L470 AbstractCegarLoop]: Abstraction has 4956 states and 6418 transitions. [2021-10-29 04:50:59,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 6418 transitions. [2021-10-29 04:50:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-29 04:50:59,296 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:59,296 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 04:50:59,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-29 04:50:59,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-29 04:50:59,523 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:59,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash 607011608, now seen corresponding path program 1 times [2021-10-29 04:50:59,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:59,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251166843] [2021-10-29 04:50:59,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:59,524 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 04:50:59,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:59,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251166843] [2021-10-29 04:50:59,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251166843] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:59,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:59,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:50:59,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121916316] [2021-10-29 04:50:59,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:50:59,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:59,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:50:59,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:50:59,565 INFO L87 Difference]: Start difference. First operand 4956 states and 6418 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:59,976 INFO L93 Difference]: Finished difference Result 11721 states and 15299 transitions. [2021-10-29 04:50:59,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:50:59,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 72 [2021-10-29 04:50:59,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:59,987 INFO L225 Difference]: With dead ends: 11721 [2021-10-29 04:50:59,987 INFO L226 Difference]: Without dead ends: 6779 [2021-10-29 04:50:59,992 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:51:00,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6779 states. [2021-10-29 04:51:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6779 to 5914. [2021-10-29 04:51:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5914 states, 5913 states have (on average 1.3006933874513784) internal successors, (7691), 5913 states have internal predecessors, (7691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 7691 transitions. [2021-10-29 04:51:00,459 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 7691 transitions. Word has length 72 [2021-10-29 04:51:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:00,460 INFO L470 AbstractCegarLoop]: Abstraction has 5914 states and 7691 transitions. [2021-10-29 04:51:00,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 7691 transitions. [2021-10-29 04:51:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-29 04:51:00,466 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:00,466 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-10-29 04:51:00,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 04:51:00,467 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash -859186428, now seen corresponding path program 1 times [2021-10-29 04:51:00,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:00,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838453775] [2021-10-29 04:51:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:00,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:51:00,540 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:00,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838453775] [2021-10-29 04:51:00,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838453775] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:51:00,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184090013] [2021-10-29 04:51:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:00,541 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:51:00,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:51:00,555 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:51:00,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-29 04:51:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:00,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-29 04:51:00,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:51:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:51:01,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:51:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:51:01,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184090013] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-29 04:51:01,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-10-29 04:51:01,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 13 [2021-10-29 04:51:01,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009979938] [2021-10-29 04:51:01,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:51:01,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:01,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:51:01,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-10-29 04:51:01,649 INFO L87 Difference]: Start difference. First operand 5914 states and 7691 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-10-29 04:51:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:02,384 INFO L93 Difference]: Finished difference Result 14232 states and 18336 transitions. [2021-10-29 04:51:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:51:02,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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 73 [2021-10-29 04:51:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:02,395 INFO L225 Difference]: With dead ends: 14232 [2021-10-29 04:51:02,395 INFO L226 Difference]: Without dead ends: 6298 [2021-10-29 04:51:02,402 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-10-29 04:51:02,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2021-10-29 04:51:02,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 5324. [2021-10-29 04:51:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5324 states, 5323 states have (on average 1.25605861356378) internal successors, (6686), 5323 states have internal predecessors, (6686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 6686 transitions. [2021-10-29 04:51:02,753 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 6686 transitions. Word has length 73 [2021-10-29 04:51:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:02,753 INFO L470 AbstractCegarLoop]: Abstraction has 5324 states and 6686 transitions. [2021-10-29 04:51:02,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-10-29 04:51:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 6686 transitions. [2021-10-29 04:51:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-29 04:51:02,758 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:02,758 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:51:02,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-29 04:51:02,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:51:02,959 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:02,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:02,959 INFO L85 PathProgramCache]: Analyzing trace with hash -272720491, now seen corresponding path program 1 times [2021-10-29 04:51:02,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:02,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879363719] [2021-10-29 04:51:02,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:02,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 04:51:03,007 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:03,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879363719] [2021-10-29 04:51:03,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879363719] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:51:03,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:51:03,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:51:03,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222812053] [2021-10-29 04:51:03,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:51:03,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:03,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:51:03,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:51:03,010 INFO L87 Difference]: Start difference. First operand 5324 states and 6686 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:03,551 INFO L93 Difference]: Finished difference Result 10444 states and 13146 transitions. [2021-10-29 04:51:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:51:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-10-29 04:51:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:03,566 INFO L225 Difference]: With dead ends: 10444 [2021-10-29 04:51:03,566 INFO L226 Difference]: Without dead ends: 6247 [2021-10-29 04:51:03,573 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:51:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6247 states. [2021-10-29 04:51:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6247 to 5324. [2021-10-29 04:51:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5324 states, 5323 states have (on average 1.2344542551192936) internal successors, (6571), 5323 states have internal predecessors, (6571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 6571 transitions. [2021-10-29 04:51:04,007 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 6571 transitions. Word has length 73 [2021-10-29 04:51:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:04,008 INFO L470 AbstractCegarLoop]: Abstraction has 5324 states and 6571 transitions. [2021-10-29 04:51:04,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 6571 transitions. [2021-10-29 04:51:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-29 04:51:04,013 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:04,014 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-10-29 04:51:04,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 04:51:04,014 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:04,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:04,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1172145059, now seen corresponding path program 1 times [2021-10-29 04:51:04,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:04,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779689815] [2021-10-29 04:51:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:04,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:51:04,065 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:04,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779689815] [2021-10-29 04:51:04,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779689815] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:51:04,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:51:04,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:51:04,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42691184] [2021-10-29 04:51:04,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:51:04,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:04,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:51:04,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:51:04,068 INFO L87 Difference]: Start difference. First operand 5324 states and 6571 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:04,589 INFO L93 Difference]: Finished difference Result 10865 states and 13384 transitions. [2021-10-29 04:51:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:51:04,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2021-10-29 04:51:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:04,597 INFO L225 Difference]: With dead ends: 10865 [2021-10-29 04:51:04,597 INFO L226 Difference]: Without dead ends: 6668 [2021-10-29 04:51:04,601 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:51:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2021-10-29 04:51:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 5579. [2021-10-29 04:51:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5579 states, 5578 states have (on average 1.2228397275008964) internal successors, (6821), 5578 states have internal predecessors, (6821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 6821 transitions. [2021-10-29 04:51:04,890 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 6821 transitions. Word has length 75 [2021-10-29 04:51:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:04,890 INFO L470 AbstractCegarLoop]: Abstraction has 5579 states and 6821 transitions. [2021-10-29 04:51:04,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 6821 transitions. [2021-10-29 04:51:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-29 04:51:04,893 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:04,894 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 04:51:04,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-29 04:51:04,894 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:04,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:04,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1736974502, now seen corresponding path program 1 times [2021-10-29 04:51:04,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:04,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575769825] [2021-10-29 04:51:04,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:04,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 04:51:04,943 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:04,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575769825] [2021-10-29 04:51:04,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575769825] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:51:04,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050912938] [2021-10-29 04:51:04,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:04,944 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:51:04,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:51:04,950 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:51:04,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-29 04:51:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:05,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-29 04:51:05,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:51:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 04:51:05,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:51:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 04:51:05,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050912938] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:51:05,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 04:51:05,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [3] total 5 [2021-10-29 04:51:05,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619173978] [2021-10-29 04:51:05,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:51:05,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:05,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:51:05,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:51:05,816 INFO L87 Difference]: Start difference. First operand 5579 states and 6821 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:06,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:06,145 INFO L93 Difference]: Finished difference Result 10818 states and 13218 transitions. [2021-10-29 04:51:06,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:51:06,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 93 [2021-10-29 04:51:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:06,153 INFO L225 Difference]: With dead ends: 10818 [2021-10-29 04:51:06,154 INFO L226 Difference]: Without dead ends: 5685 [2021-10-29 04:51:06,158 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:51:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5685 states. [2021-10-29 04:51:06,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5685 to 5579. [2021-10-29 04:51:06,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5579 states, 5578 states have (on average 1.2065256364288275) internal successors, (6730), 5578 states have internal predecessors, (6730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:06,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 6730 transitions. [2021-10-29 04:51:06,606 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 6730 transitions. Word has length 93 [2021-10-29 04:51:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:06,606 INFO L470 AbstractCegarLoop]: Abstraction has 5579 states and 6730 transitions. [2021-10-29 04:51:06,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 6730 transitions. [2021-10-29 04:51:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-29 04:51:06,610 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:06,610 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 04:51:06,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-29 04:51:06,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:51:06,811 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:06,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:06,811 INFO L85 PathProgramCache]: Analyzing trace with hash -623003666, now seen corresponding path program 1 times [2021-10-29 04:51:06,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:06,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148113318] [2021-10-29 04:51:06,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:06,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:51:06,856 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:06,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148113318] [2021-10-29 04:51:06,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148113318] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:51:06,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:51:06,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:51:06,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979630043] [2021-10-29 04:51:06,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:51:06,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:51:06,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:51:06,858 INFO L87 Difference]: Start difference. First operand 5579 states and 6730 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:07,172 INFO L93 Difference]: Finished difference Result 8628 states and 10459 transitions. [2021-10-29 04:51:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:51:07,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-10-29 04:51:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:07,179 INFO L225 Difference]: With dead ends: 8628 [2021-10-29 04:51:07,179 INFO L226 Difference]: Without dead ends: 3503 [2021-10-29 04:51:07,185 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:51:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2021-10-29 04:51:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3483. [2021-10-29 04:51:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3483 states, 3482 states have (on average 1.163699023549684) internal successors, (4052), 3482 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 4052 transitions. [2021-10-29 04:51:07,428 INFO L78 Accepts]: Start accepts. Automaton has 3483 states and 4052 transitions. Word has length 94 [2021-10-29 04:51:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:07,429 INFO L470 AbstractCegarLoop]: Abstraction has 3483 states and 4052 transitions. [2021-10-29 04:51:07,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3483 states and 4052 transitions. [2021-10-29 04:51:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-29 04:51:07,431 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:07,431 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-10-29 04:51:07,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-29 04:51:07,431 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:07,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1036850775, now seen corresponding path program 1 times [2021-10-29 04:51:07,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:07,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242891812] [2021-10-29 04:51:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:07,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:51:07,489 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:07,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242891812] [2021-10-29 04:51:07,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242891812] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:51:07,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:51:07,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:51:07,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876930996] [2021-10-29 04:51:07,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:51:07,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:07,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:51:07,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:51:07,491 INFO L87 Difference]: Start difference. First operand 3483 states and 4052 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:07,820 INFO L93 Difference]: Finished difference Result 7376 states and 8513 transitions. [2021-10-29 04:51:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:51:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2021-10-29 04:51:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:07,825 INFO L225 Difference]: With dead ends: 7376 [2021-10-29 04:51:07,825 INFO L226 Difference]: Without dead ends: 4352 [2021-10-29 04:51:07,827 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:51:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4352 states. [2021-10-29 04:51:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4352 to 3731. [2021-10-29 04:51:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 3730 states have (on average 1.1361930294906166) internal successors, (4238), 3730 states have internal predecessors, (4238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4238 transitions. [2021-10-29 04:51:08,024 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4238 transitions. Word has length 96 [2021-10-29 04:51:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:08,024 INFO L470 AbstractCegarLoop]: Abstraction has 3731 states and 4238 transitions. [2021-10-29 04:51:08,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4238 transitions. [2021-10-29 04:51:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-29 04:51:08,027 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:08,027 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:51:08,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-29 04:51:08,027 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1490254128, now seen corresponding path program 1 times [2021-10-29 04:51:08,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:08,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22288207] [2021-10-29 04:51:08,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:08,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 04:51:08,089 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:08,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22288207] [2021-10-29 04:51:08,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22288207] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:51:08,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639871081] [2021-10-29 04:51:08,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:08,090 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:51:08,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:51:08,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:51:08,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-29 04:51:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:08,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-29 04:51:08,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:51:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-29 04:51:09,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:51:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-29 04:51:09,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639871081] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:51:09,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 04:51:09,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [4] total 8 [2021-10-29 04:51:09,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932535904] [2021-10-29 04:51:09,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 04:51:09,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:09,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 04:51:09,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:51:09,797 INFO L87 Difference]: Start difference. First operand 3731 states and 4238 transitions. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:10,231 INFO L93 Difference]: Finished difference Result 7406 states and 8389 transitions. [2021-10-29 04:51:10,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:51:10,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 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 99 [2021-10-29 04:51:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:10,236 INFO L225 Difference]: With dead ends: 7406 [2021-10-29 04:51:10,236 INFO L226 Difference]: Without dead ends: 4543 [2021-10-29 04:51:10,239 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-29 04:51:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2021-10-29 04:51:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 3731. [2021-10-29 04:51:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 3730 states have (on average 1.1329758713136728) internal successors, (4226), 3730 states have internal predecessors, (4226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4226 transitions. [2021-10-29 04:51:10,523 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4226 transitions. Word has length 99 [2021-10-29 04:51:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:10,523 INFO L470 AbstractCegarLoop]: Abstraction has 3731 states and 4226 transitions. [2021-10-29 04:51:10,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4226 transitions. [2021-10-29 04:51:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-29 04:51:10,525 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:10,526 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-10-29 04:51:10,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-29 04:51:10,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:51:10,726 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:10,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1700743775, now seen corresponding path program 1 times [2021-10-29 04:51:10,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:10,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121083309] [2021-10-29 04:51:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:10,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 04:51:10,870 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:10,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121083309] [2021-10-29 04:51:10,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121083309] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:51:10,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:51:10,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 04:51:10,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399970268] [2021-10-29 04:51:10,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:51:10,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:10,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:51:10,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:51:10,872 INFO L87 Difference]: Start difference. First operand 3731 states and 4226 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:11,865 INFO L93 Difference]: Finished difference Result 12497 states and 14274 transitions. [2021-10-29 04:51:11,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:51:11,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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 118 [2021-10-29 04:51:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:11,877 INFO L225 Difference]: With dead ends: 12497 [2021-10-29 04:51:11,878 INFO L226 Difference]: Without dead ends: 10471 [2021-10-29 04:51:11,882 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:51:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10471 states. [2021-10-29 04:51:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10471 to 6505. [2021-10-29 04:51:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6505 states, 6504 states have (on average 1.1432964329643296) internal successors, (7436), 6504 states have internal predecessors, (7436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6505 states to 6505 states and 7436 transitions. [2021-10-29 04:51:12,316 INFO L78 Accepts]: Start accepts. Automaton has 6505 states and 7436 transitions. Word has length 118 [2021-10-29 04:51:12,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:12,317 INFO L470 AbstractCegarLoop]: Abstraction has 6505 states and 7436 transitions. [2021-10-29 04:51:12,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 6505 states and 7436 transitions. [2021-10-29 04:51:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-10-29 04:51:12,320 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:12,321 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2021-10-29 04:51:12,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-29 04:51:12,321 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1926987636, now seen corresponding path program 1 times [2021-10-29 04:51:12,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:12,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519422537] [2021-10-29 04:51:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:12,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-29 04:51:12,361 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:12,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519422537] [2021-10-29 04:51:12,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519422537] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:51:12,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:51:12,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:51:12,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968465952] [2021-10-29 04:51:12,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:51:12,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:12,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:51:12,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:51:12,363 INFO L87 Difference]: Start difference. First operand 6505 states and 7436 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:12,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:12,953 INFO L93 Difference]: Finished difference Result 13519 states and 15527 transitions. [2021-10-29 04:51:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:51:12,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 123 [2021-10-29 04:51:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:12,961 INFO L225 Difference]: With dead ends: 13519 [2021-10-29 04:51:12,962 INFO L226 Difference]: Without dead ends: 7228 [2021-10-29 04:51:12,967 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:51:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7228 states. [2021-10-29 04:51:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7228 to 6512. [2021-10-29 04:51:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6512 states, 6511 states have (on average 1.155582859775764) internal successors, (7524), 6511 states have internal predecessors, (7524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 7524 transitions. [2021-10-29 04:51:13,521 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 7524 transitions. Word has length 123 [2021-10-29 04:51:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:13,522 INFO L470 AbstractCegarLoop]: Abstraction has 6512 states and 7524 transitions. [2021-10-29 04:51:13,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:13,522 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 7524 transitions. [2021-10-29 04:51:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-10-29 04:51:13,528 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:13,528 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:51:13,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-29 04:51:13,529 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:13,529 INFO L85 PathProgramCache]: Analyzing trace with hash -175805878, now seen corresponding path program 1 times [2021-10-29 04:51:13,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:13,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462839342] [2021-10-29 04:51:13,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:13,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-29 04:51:13,592 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:13,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462839342] [2021-10-29 04:51:13,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462839342] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:51:13,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:51:13,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:51:13,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174878423] [2021-10-29 04:51:13,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:51:13,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:13,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:51:13,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:51:13,595 INFO L87 Difference]: Start difference. First operand 6512 states and 7524 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 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-10-29 04:51:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:14,001 INFO L93 Difference]: Finished difference Result 10459 states and 12009 transitions. [2021-10-29 04:51:14,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:51:14,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 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 143 [2021-10-29 04:51:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:14,008 INFO L225 Difference]: With dead ends: 10459 [2021-10-29 04:51:14,008 INFO L226 Difference]: Without dead ends: 4519 [2021-10-29 04:51:14,013 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:51:14,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2021-10-29 04:51:14,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4105. [2021-10-29 04:51:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4104 states have (on average 1.1401072124756335) internal successors, (4679), 4104 states have internal predecessors, (4679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 4679 transitions. [2021-10-29 04:51:14,328 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 4679 transitions. Word has length 143 [2021-10-29 04:51:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:14,328 INFO L470 AbstractCegarLoop]: Abstraction has 4105 states and 4679 transitions. [2021-10-29 04:51:14,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 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-10-29 04:51:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 4679 transitions. [2021-10-29 04:51:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-10-29 04:51:14,330 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:14,331 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-29 04:51:14,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-29 04:51:14,331 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:14,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1597127135, now seen corresponding path program 1 times [2021-10-29 04:51:14,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:14,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371229478] [2021-10-29 04:51:14,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:14,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:14,382 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-10-29 04:51:14,382 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:14,382 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371229478] [2021-10-29 04:51:14,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371229478] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:51:14,383 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:51:14,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:51:14,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462068206] [2021-10-29 04:51:14,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:51:14,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:14,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:51:14,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:51:14,384 INFO L87 Difference]: Start difference. First operand 4105 states and 4679 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:14,729 INFO L93 Difference]: Finished difference Result 7055 states and 8004 transitions. [2021-10-29 04:51:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:51:14,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 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 144 [2021-10-29 04:51:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:14,733 INFO L225 Difference]: With dead ends: 7055 [2021-10-29 04:51:14,733 INFO L226 Difference]: Without dead ends: 3410 [2021-10-29 04:51:14,736 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:51:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2021-10-29 04:51:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3093. [2021-10-29 04:51:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3093 states, 3092 states have (on average 1.1345407503234153) internal successors, (3508), 3092 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 3508 transitions. [2021-10-29 04:51:14,973 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 3508 transitions. Word has length 144 [2021-10-29 04:51:14,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:14,973 INFO L470 AbstractCegarLoop]: Abstraction has 3093 states and 3508 transitions. [2021-10-29 04:51:14,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:14,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 3508 transitions. [2021-10-29 04:51:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-10-29 04:51:14,977 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:51:14,977 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-29 04:51:14,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-29 04:51:14,978 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:51:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:51:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash 262470301, now seen corresponding path program 1 times [2021-10-29 04:51:14,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:51:14,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480650253] [2021-10-29 04:51:14,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:14,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:51:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 04:51:15,095 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:51:15,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480650253] [2021-10-29 04:51:15,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480650253] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 04:51:15,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434405261] [2021-10-29 04:51:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:51:15,096 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:51:15,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:51:15,106 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 04:51:15,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-29 04:51:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:51:15,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-29 04:51:15,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:51:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:51:16,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:51:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 04:51:16,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434405261] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:51:16,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 04:51:16,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 11 [2021-10-29 04:51:16,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473656181] [2021-10-29 04:51:16,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:51:16,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:51:16,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:51:16,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-29 04:51:16,440 INFO L87 Difference]: Start difference. First operand 3093 states and 3508 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:51:16,647 INFO L93 Difference]: Finished difference Result 3716 states and 4199 transitions. [2021-10-29 04:51:16,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:51:16,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 145 [2021-10-29 04:51:16,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:51:16,648 INFO L225 Difference]: With dead ends: 3716 [2021-10-29 04:51:16,648 INFO L226 Difference]: Without dead ends: 0 [2021-10-29 04:51:16,650 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-29 04:51:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-29 04:51:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-29 04:51:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 04:51:16,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2021-10-29 04:51:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:51:16,650 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 04:51:16,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:51:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-29 04:51:16,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-29 04:51:16,652 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:51:16,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-29 04:51:16,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 04:51:16,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-29 04:51:16,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:16,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:17,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:17,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:17,127 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:21,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:21,212 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:21,284 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:22,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:22,354 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:22,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:22,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:22,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:22,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:22,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:22,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:23,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:23,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:23,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:23,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:23,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:23,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:26,355 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:26,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:26,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:26,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:27,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:27,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:28,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:28,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:28,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:29,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:29,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:33,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:34,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:35,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:35,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:35,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:35,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:35,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:35,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:35,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:35,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:35,539 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:35,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:35,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 04:51:55,340 WARN L207 SmtUtils]: Spent 5.56 s on a formula simplification. DAG size of input: 685 DAG size of output: 155 [2021-10-29 04:52:08,871 WARN L207 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 827 DAG size of output: 167 [2021-10-29 04:52:17,057 INFO L853 garLoopResultBuilder]: At program point L103-1(lines 91 122) the Hoare annotation is: (let ((.cse30 (+ ~local~0 1)) (.cse22 (= ~t3_pc~0 1)) (.cse4 (= ~t2_pc~0 1))) (let ((.cse27 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse0 (= ~m_st~0 2)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse29 (<= 2 ~t2_st~0)) (.cse28 (<= 2 ~t3_st~0)) (.cse25 (= 0 ~t2_pc~0)) (.cse26 (not .cse4)) (.cse17 (= 2 ~t3_st~0)) (.cse1 (= 2 ~t2_st~0)) (.cse15 (= ~m_pc~0 0)) (.cse24 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not .cse22)) (.cse18 (<= ~token~0 .cse30)) (.cse3 (= ~E_3~0 2)) (.cse23 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse5 (= ~m_pc~0 1)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (<= .cse30 ~token~0)) (.cse7 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse21 (= 0 ~t2_st~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse15 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 (or (and .cse17 .cse18 .cse3 .cse4 .cse5 .cse19 .cse7 .cse20 .cse8 .cse21 .cse12 .cse13 .cse22) (and .cse17 .cse18 .cse3 .cse23 .cse4 .cse5 .cse19 .cse7 .cse20 .cse8 .cse21 .cse24 .cse13 .cse22)) .cse9) (and .cse17 .cse3 .cse7 .cse15 .cse25 .cse8 .cse9 .cse21 .cse26 .cse12 .cse13 .cse22) (and .cse17 .cse16 .cse3 .cse5 .cse6 .cse7 .cse20 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0) .cse25 .cse8 .cse9 .cse21 .cse12 .cse13 .cse22) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse20 .cse15 .cse25 .cse8 .cse21 .cse12 .cse13 .cse14) (and .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14 .cse27) (and .cse2 (= ~E_3~0 ~E_1~0) .cse7 .cse15 .cse25 .cse8 .cse9 .cse21 .cse12 .cse13 .cse14) (and (= ~t1_pc~0 1) .cse16 .cse2 .cse3 .cse5 .cse6 .cse7 .cse20 .cse25 .cse8 .cse9 .cse21 .cse12 .cse13 .cse14) (and .cse17 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse22) (and .cse6 .cse20 .cse15 .cse8 .cse24 .cse13 .cse22) (and .cse6 .cse20 .cse15 .cse8 .cse12 .cse13 .cse14) (and .cse17 .cse16 .cse1 .cse3 .cse4 .cse5 .cse7 .cse20 .cse8 .cse9 .cse24 .cse13 .cse22 .cse27) (and .cse28 .cse20 .cse15 .cse8 .cse29 .cse24 .cse13 .cse22) (and .cse17 .cse0 .cse3 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse22) (and .cse2 .cse20 .cse15 .cse8 .cse29 .cse12 .cse13 .cse14) (and .cse28 .cse20 .cse15 .cse25 .cse8 .cse21 .cse26 .cse12 .cse13 .cse22) (and .cse17 .cse1 .cse3 .cse4 .cse7 .cse15 .cse8 .cse9 .cse24 .cse13 .cse22) (and .cse16 .cse2 .cse18 .cse3 .cse23 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse21 .cse12 .cse13 .cse14)))) [2021-10-29 04:52:17,058 INFO L853 garLoopResultBuilder]: At program point L368(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse35 (+ ~local~0 1)) (.cse23 (= ~t2_pc~0 1))) (let ((.cse0 (= ~m_st~0 2)) (.cse27 (<= 2 ~t3_st~0)) (.cse30 (not .cse23)) (.cse31 (<= ~token~0 .cse35)) (.cse32 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse33 (<= .cse35 ~token~0)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= 2 ~t1_st~0)) (.cse19 (not (= ~E_3~0 1))) (.cse25 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse28 (<= 2 ~t2_st~0)) (.cse22 (= 2 ~t2_st~0)) (.cse26 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse29 (= ~E_3~0 ~E_1~0)) (.cse24 (= ~m_pc~0 0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse22 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse26 .cse27 .cse3 .cse20 .cse24 .cse8 .cse28 .cse25 .cse13 .cse21) (and .cse16 .cse0 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse18 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse26 .cse3 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse21) (and .cse1 .cse26 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse30 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse8 .cse25 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse16 .cse22 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse22 .cse1 .cse18 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse22 .cse1 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse26 .cse3 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14) (and .cse15 .cse17 .cse1 .cse31 .cse18 .cse2 .cse32 .cse23 .cse4 .cse5 .cse33 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse22 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse16 .cse22 .cse26 .cse3 .cse23 .cse29 .cse6 .cse24 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (let ((.cse34 (+ 2 ~local~0))) (and .cse15 .cse17 (<= .cse34 ~token~0) (<= ~token~0 .cse34) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14 .cse21)) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse20 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse26 .cse27 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse30 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse18 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse17 .cse18 (or (and .cse15 .cse16 .cse31 .cse2 .cse23 .cse4 .cse33 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse31 .cse2 .cse32 .cse23 .cse4 .cse33 .cse6 .cse20 .cse8 .cse9 .cse25 .cse13 .cse21))) (and .cse15 .cse16 .cse17 .cse22 .cse18 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 .cse21) (and .cse1 .cse3 .cse20 .cse24 .cse8 .cse28 .cse12 .cse13 .cse14) (and .cse22 .cse1 .cse26 .cse3 .cse23 .cse29 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-29 04:52:17,058 INFO L857 garLoopResultBuilder]: For program point L238(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,059 INFO L857 garLoopResultBuilder]: For program point L238-2(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,059 INFO L857 garLoopResultBuilder]: For program point L238-3(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,059 INFO L857 garLoopResultBuilder]: For program point L238-5(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,059 INFO L857 garLoopResultBuilder]: For program point L238-6(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,059 INFO L857 garLoopResultBuilder]: For program point L238-8(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,059 INFO L857 garLoopResultBuilder]: For program point L238-9(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,059 INFO L857 garLoopResultBuilder]: For program point L238-11(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,059 INFO L857 garLoopResultBuilder]: For program point L238-12(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,059 INFO L857 garLoopResultBuilder]: For program point L238-14(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L238-15(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L238-17(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L238-18(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L238-20(lines 238 247) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L371(lines 371 378) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L239(lines 239 244) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L239-1(lines 239 244) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L239-2(lines 239 244) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L239-3(lines 239 244) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L239-4(lines 239 244) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L239-5(lines 239 244) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L239-6(lines 239 244) no Hoare annotation was computed. [2021-10-29 04:52:17,060 INFO L857 garLoopResultBuilder]: For program point L702(lines 702 706) no Hoare annotation was computed. [2021-10-29 04:52:17,061 INFO L853 garLoopResultBuilder]: At program point L175-1(lines 163 194) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse13 (not .cse0)) (.cse23 (= ~E_3~0 ~E_1~0)) (.cse18 (= ~m_st~0 2)) (.cse17 (< 0 ~t3_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= 0 ~t2_pc~0)) (.cse8 (= 0 ~t2_st~0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse19 (= 2 ~t2_st~0)) (.cse22 (= 2 ~t1_st~0)) (.cse1 (= ~E_3~0 2)) (.cse20 (= ~t2_pc~0 1)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse15 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse5 .cse15 .cse7 (<= 2 ~t2_st~0) .cse16 .cse12) (and .cse13 .cse17 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse18 .cse19 .cse17 .cse1 .cse14 .cse20 .cse2 .cse3 .cse4 .cse7 .cse9 .cse10 .cse16 .cse12) (and .cse0 .cse21 (<= (+ 3 ~local~0) ~token~0) .cse19 .cse22 .cse1 .cse20 .cse2 .cse4 .cse7 .cse16 .cse12 (< ~token~0 (+ ~local~0 4)) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (and .cse0 .cse19 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse16 .cse12) (and .cse0 .cse22 .cse23 .cse4 .cse15 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse19 .cse13 .cse14 .cse20 .cse23 .cse4 .cse15 .cse7 .cse9 .cse10 .cse16 .cse12) (let ((.cse24 (+ ~local~0 1))) (and .cse0 .cse21 (<= ~token~0 .cse24) .cse22 .cse1 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse20 .cse2 .cse3 (<= .cse24 ~token~0) .cse4 .cse5 .cse7 .cse8 .cse16 .cse12)) (and .cse13 .cse17 .cse14 .cse23 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse18 .cse17 .cse1 .cse14 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse21 .cse19 .cse22 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse7 .cse16 .cse12) (and .cse0 .cse21 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse0 .cse19 .cse22 .cse1 .cse20 .cse4 .cse15 .cse7 .cse16 .cse12) (and .cse0 .cse5 .cse15 .cse7 .cse16 .cse12)))) [2021-10-29 04:52:17,061 INFO L860 garLoopResultBuilder]: At program point L708(lines 655 713) the Hoare annotation is: true [2021-10-29 04:52:17,061 INFO L857 garLoopResultBuilder]: For program point L48(lines 48 56) no Hoare annotation was computed. [2021-10-29 04:52:17,061 INFO L853 garLoopResultBuilder]: At program point L249(lines 237 251) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-10-29 04:52:17,061 INFO L853 garLoopResultBuilder]: At program point L249-1(lines 237 251) the Hoare annotation is: (let ((.cse12 (= ~t3_pc~0 1))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse14 (= 2 ~t2_st~0)) (.cse18 (not .cse12)) (.cse15 (= ~t2_pc~0 1)) (.cse19 (= 0 ~t3_st~0)) (.cse1 (= 2 ~t3_st~0)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~E_3~0 2)) (.cse17 (= ~t1_st~0 0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= 0 ~t2_pc~0)) (.cse7 (= ~E_M~0 2)) (.cse8 (= 0 ~t2_st~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse12 .cse13) (and .cse1 .cse16 .cse14 .cse2 .cse17 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse0 .cse14 .cse18 .cse2 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse16 .cse18 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse16 .cse14 .cse18 .cse2 .cse17 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse1 .cse16 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-10-29 04:52:17,061 INFO L853 garLoopResultBuilder]: At program point L249-2(lines 237 251) the Hoare annotation is: (let ((.cse7 (= ~t3_pc~0 1)) (.cse25 (+ ~local~0 1))) (let ((.cse10 (= 2 ~t2_st~0)) (.cse23 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse12 (not (= ~E_3~0 1))) (.cse5 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= 2 ~t3_st~0)) (.cse22 (<= ~token~0 .cse25)) (.cse13 (= ~t2_pc~0 1)) (.cse24 (<= .cse25 ~token~0)) (.cse3 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse17 (not .cse7)) (.cse11 (= ~E_3~0 2)) (.cse14 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~m_st~0 0))) (.cse20 (= 0 ~t2_pc~0)) (.cse4 (= ~E_M~0 2)) (.cse15 (not (= ~t1_st~0 0))) (.cse21 (= 0 ~t2_st~0)) (.cse18 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse6 (= ~E_1~0 2)) (.cse19 (= 0 ~t3_st~0)) (.cse16 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse1 .cse2 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16) (and .cse0 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13 .cse14 .cse1 .cse2 .cse4 .cse15 .cse18 .cse6 .cse19 .cse16) (and .cse0 .cse8 .cse9 .cse11 .cse14 .cse1 .cse2 .cse20 .cse4 .cse15 .cse21 .cse18 .cse6 .cse7 .cse16) (and .cse0 .cse9 .cse17 .cse22 .cse11 .cse23 .cse12 .cse13 .cse14 .cse1 .cse24 .cse2 .cse4 .cse15 .cse18 .cse6 .cse19) (and .cse9 (or (and .cse0 .cse8 .cse22 .cse11 .cse23 .cse12 .cse13 .cse14 .cse1 .cse24 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse22 .cse11 .cse13 .cse14 .cse1 .cse24 .cse2 .cse4 .cse21 .cse18 .cse6 .cse7)) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse6 .cse19) (and .cse0 .cse9 .cse17 .cse11 .cse14 .cse1 .cse2 .cse20 .cse4 .cse15 .cse21 .cse18 .cse6 .cse19 .cse16)))) [2021-10-29 04:52:17,062 INFO L853 garLoopResultBuilder]: At program point L249-3(lines 237 251) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse10 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t2_st~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse13 .cse2)) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse16 .cse13 .cse2) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse12 .cse13 .cse14))) [2021-10-29 04:52:17,062 INFO L853 garLoopResultBuilder]: At program point L249-4(lines 237 251) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t2_st~0)) (.cse10 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t3_st~0)) (.cse11 (= ~E_3~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse3 (not (= ~E_M~0 0))) (.cse14 (= ~E_2~0 2)) (.cse5 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse7 (= ~t3_pc~0 1)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse8 (<= (+ 3 ~local~0) ~token~0) .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse3 .cse14 .cse5 .cse6 .cse7 (< ~token~0 (+ ~local~0 4)) .cse15))) [2021-10-29 04:52:17,062 INFO L853 garLoopResultBuilder]: At program point L249-5(lines 237 251) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse7 (= 2 ~t3_st~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t2_st~0)) (.cse11 (= ~E_3~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 2)) (.cse5 (= ~E_1~0 2)) (.cse6 (= ~t3_pc~0 1)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6 .cse15) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15) (and .cse0 .cse7 .cse8 (<= (+ 3 ~local~0) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse4 .cse5 .cse6 (< ~token~0 (+ ~local~0 4)) .cse15) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse1 .cse14 .cse2 .cse4 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse6 .cse15))) [2021-10-29 04:52:17,062 INFO L857 garLoopResultBuilder]: For program point L51(lines 51 55) no Hoare annotation was computed. [2021-10-29 04:52:17,062 INFO L853 garLoopResultBuilder]: At program point L249-6(lines 237 251) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-29 04:52:17,062 INFO L853 garLoopResultBuilder]: At program point L382(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse23 (= ~t2_pc~0 1)) (.cse36 (+ ~local~0 1))) (let ((.cse34 (<= ~token~0 .cse36)) (.cse35 (<= .cse36 ~token~0)) (.cse0 (= ~m_st~0 2)) (.cse30 (<= 2 ~t3_st~0)) (.cse33 (not .cse23)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= 2 ~t1_st~0)) (.cse19 (not (= ~E_3~0 1))) (.cse25 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse31 (<= 2 ~t2_st~0)) (.cse22 (= 2 ~t2_st~0)) (.cse29 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse32 (= ~E_3~0 ~E_1~0)) (.cse24 (= ~m_pc~0 0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse22 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse17 (let ((.cse28 (+ 2 ~local~0))) (let ((.cse26 (<= .cse28 ~token~0)) (.cse27 (<= ~token~0 .cse28))) (or (and .cse15 .cse26 .cse27 .cse22 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 1) .cse14 .cse21) (and .cse15 .cse26 .cse27 .cse22 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14 .cse21)))) .cse18) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse29 .cse30 .cse3 .cse20 .cse24 .cse8 .cse31 .cse25 .cse13 .cse21) (and .cse16 .cse0 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse18 .cse32 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse29 .cse3 .cse32 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse34 .cse18 .cse2 .cse23 .cse4 .cse35 .cse6 .cse20 .cse8 .cse9 .cse25 .cse13 .cse21) (and .cse1 .cse29 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse33 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse8 .cse25 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse16 .cse22 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse22 .cse1 .cse18 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse22 .cse1 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse18 .cse2 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse1 .cse29 .cse3 .cse32 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14) (and .cse15 .cse17 .cse1 .cse34 .cse18 .cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse23 .cse4 .cse5 .cse35 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse22 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse16 .cse22 .cse29 .cse3 .cse23 .cse32 .cse6 .cse24 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse20 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse29 .cse30 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse33 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse22 .cse18 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 .cse21) (and .cse1 .cse3 .cse20 .cse24 .cse8 .cse31 .cse12 .cse13 .cse14) (and .cse22 .cse1 .cse29 .cse3 .cse23 .cse32 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-29 04:52:17,063 INFO L853 garLoopResultBuilder]: At program point L52(lines 47 86) the Hoare annotation is: (and (= ~t1_pc~0 1) (= 2 ~t3_st~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= (+ 3 ~local~0) ~token~0) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~E_3~0 2) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (= ~E_M~0 2) (not (= ULTIMATE.start_eval_~tmp~0 0)) (= ~E_1~0 2) (= ~t3_pc~0 1) (< ~token~0 (+ ~local~0 4))) [2021-10-29 04:52:17,063 INFO L857 garLoopResultBuilder]: For program point L385(lines 385 392) no Hoare annotation was computed. [2021-10-29 04:52:17,063 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-29 04:52:17,063 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,063 INFO L857 garLoopResultBuilder]: For program point L257-2(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,063 INFO L857 garLoopResultBuilder]: For program point L257-3(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,063 INFO L857 garLoopResultBuilder]: For program point L257-5(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,063 INFO L857 garLoopResultBuilder]: For program point L257-6(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,063 INFO L857 garLoopResultBuilder]: For program point L257-8(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,063 INFO L857 garLoopResultBuilder]: For program point L257-9(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,063 INFO L857 garLoopResultBuilder]: For program point L257-11(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,063 INFO L857 garLoopResultBuilder]: For program point L257-12(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L257-14(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L257-15(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L257-17(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L257-18(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L257-20(lines 257 266) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L258(lines 258 263) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L258-1(lines 258 263) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L258-2(lines 258 263) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L258-3(lines 258 263) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L258-4(lines 258 263) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L258-5(lines 258 263) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L258-6(lines 258 263) no Hoare annotation was computed. [2021-10-29 04:52:17,064 INFO L857 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2021-10-29 04:52:17,065 INFO L853 garLoopResultBuilder]: At program point L131(lines 131 135) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= 2 ~t1_st~0)) (.cse12 (= ~E_3~0 2)) (.cse1 (< 0 ~t2_st~0)) (.cse13 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse15 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 2)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse9 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse6 .cse9) (and .cse0 .cse10 (not .cse9) .cse11 .cse12 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse1 .cse13 .cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse15 .cse2 .cse4 .cse5 .cse6 .cse7) (let ((.cse16 (+ ~local~0 1))) (and .cse0 (= 2 ~t3_st~0) .cse10 (<= ~token~0 .cse16) .cse11 .cse12 .cse1 .cse13 .cse14 (<= .cse16 ~token~0) .cse15 .cse2 .cse4 .cse8 .cse6 .cse9)))) [2021-10-29 04:52:17,065 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-29 04:52:17,065 INFO L853 garLoopResultBuilder]: At program point L396(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse30 (= ~t2_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse34 (+ ~local~0 1))) (let ((.cse28 (<= 2 ~t2_st~0)) (.cse31 (<= ~token~0 .cse34)) (.cse32 (<= .cse34 ~token~0)) (.cse0 (= ~m_st~0 2)) (.cse23 (= ~E_3~0 ~E_1~0)) (.cse26 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse19 (not (= ~E_3~0 1))) (.cse22 (not .cse15)) (.cse27 (<= 2 ~t3_st~0)) (.cse3 (= ~t1_st~0 0)) (.cse24 (= ~m_pc~0 0)) (.cse25 (not .cse30)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse29 (= 2 ~t2_st~0)) (.cse18 (= 2 ~t1_st~0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse1 .cse22 .cse3 .cse23 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse13 .cse14) (and .cse15 .cse1 .cse20 .cse24 .cse8 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse22 .cse27 .cse3 .cse20 .cse24 .cse8 .cse28 .cse26 .cse13 .cse21) (and .cse16 .cse0 .cse29 .cse2 .cse3 .cse30 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse26 .cse13 .cse21) (and .cse15 .cse17 .cse29 .cse1 .cse18 .cse2 .cse19 .cse30 .cse4 .cse5 .cse6 .cse20 .cse8 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse29 .cse18 .cse2 .cse30 .cse6 .cse24 .cse8 .cse13 .cse21) (and .cse16 .cse22 .cse3 .cse23 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse13 .cse21) (and .cse0 .cse29 .cse1 .cse2 .cse3 .cse30 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse31 .cse18 .cse2 .cse30 .cse4 .cse32 .cse6 .cse20 .cse8 .cse9 .cse26 .cse13 .cse21) (let ((.cse33 (+ 2 ~local~0))) (and .cse15 .cse17 (<= .cse33 ~token~0) (<= ~token~0 .cse33) .cse29 .cse18 .cse2 .cse30 .cse4 .cse6 .cse20 .cse8 .cse26 .cse13 .cse14 .cse21)) (and .cse15 .cse29 .cse1 .cse2 .cse19 .cse30 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse26 .cse13 .cse14) (and .cse1 .cse22 .cse3 .cse20 .cse24 .cse8 .cse28 .cse26 .cse13 .cse14) (and .cse29 .cse1 .cse22 .cse3 .cse30 .cse23 .cse6 .cse24 .cse8 .cse10 .cse11 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse29 .cse18 .cse2 .cse19 .cse30 .cse4 .cse6 .cse20 .cse8 .cse13 .cse21) (and .cse15 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse14) (and .cse15 .cse29 .cse1 .cse18 .cse2 .cse30 .cse6 .cse24 .cse8 .cse26 .cse13 .cse14) (and .cse15 .cse17 .cse1 .cse31 .cse18 .cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse30 .cse4 .cse5 .cse32 .cse6 .cse20 .cse8 .cse9 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse29 .cse2 .cse30 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse26 .cse13 .cse21) (and .cse15 .cse16 .cse18 .cse2 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse1 .cse22 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse25 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse16 .cse29 .cse22 .cse3 .cse30 .cse23 .cse6 .cse24 .cse8 .cse10 .cse11 .cse26 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse29 .cse2 .cse19 .cse30 .cse4 .cse6 .cse20 .cse8 (not .cse3) .cse10 .cse11 .cse13 .cse21) (and .cse22 .cse27 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse25 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse29 .cse18 .cse2 .cse30 .cse4 .cse6 .cse8 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-29 04:52:17,066 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,066 INFO L857 garLoopResultBuilder]: For program point L200-2(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,066 INFO L857 garLoopResultBuilder]: For program point L200-3(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,066 INFO L857 garLoopResultBuilder]: For program point L200-5(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,066 INFO L857 garLoopResultBuilder]: For program point L200-6(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,066 INFO L857 garLoopResultBuilder]: For program point L200-8(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,067 INFO L857 garLoopResultBuilder]: For program point L200-9(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,067 INFO L857 garLoopResultBuilder]: For program point L200-11(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,067 INFO L857 garLoopResultBuilder]: For program point L200-12(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,067 INFO L857 garLoopResultBuilder]: For program point L200-14(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,067 INFO L857 garLoopResultBuilder]: For program point L200-15(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,067 INFO L857 garLoopResultBuilder]: For program point L200-17(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,067 INFO L857 garLoopResultBuilder]: For program point L200-18(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,068 INFO L857 garLoopResultBuilder]: For program point L200-20(lines 200 209) no Hoare annotation was computed. [2021-10-29 04:52:17,068 INFO L857 garLoopResultBuilder]: For program point L399(lines 399 406) no Hoare annotation was computed. [2021-10-29 04:52:17,068 INFO L857 garLoopResultBuilder]: For program point L201(lines 201 206) no Hoare annotation was computed. [2021-10-29 04:52:17,068 INFO L857 garLoopResultBuilder]: For program point L201-1(lines 201 206) no Hoare annotation was computed. [2021-10-29 04:52:17,068 INFO L857 garLoopResultBuilder]: For program point L201-2(lines 201 206) no Hoare annotation was computed. [2021-10-29 04:52:17,068 INFO L857 garLoopResultBuilder]: For program point L201-3(lines 201 206) no Hoare annotation was computed. [2021-10-29 04:52:17,069 INFO L857 garLoopResultBuilder]: For program point L201-4(lines 201 206) no Hoare annotation was computed. [2021-10-29 04:52:17,069 INFO L857 garLoopResultBuilder]: For program point L201-5(lines 201 206) no Hoare annotation was computed. [2021-10-29 04:52:17,069 INFO L857 garLoopResultBuilder]: For program point L201-6(lines 201 206) no Hoare annotation was computed. [2021-10-29 04:52:17,069 INFO L853 garLoopResultBuilder]: At program point L268(lines 256 270) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-10-29 04:52:17,069 INFO L853 garLoopResultBuilder]: At program point L268-1(lines 256 270) the Hoare annotation is: (let ((.cse14 (= ~t3_pc~0 1))) (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= ~t1_st~0 0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse0 (= 2 ~t3_st~0)) (.cse16 (= ~t1_pc~0 1)) (.cse19 (= 2 ~t2_st~0)) (.cse17 (not .cse14)) (.cse2 (= ~E_3~0 2)) (.cse20 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse9 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse15) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse19 .cse17 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse18 .cse15) (and .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse15) (and .cse16 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse19 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse14 .cse15) (and .cse16 .cse19 .cse17 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse18 .cse15)))) [2021-10-29 04:52:17,070 INFO L853 garLoopResultBuilder]: At program point L268-2(lines 256 270) the Hoare annotation is: (let ((.cse25 (+ ~local~0 1)) (.cse14 (= ~t3_pc~0 1))) (let ((.cse16 (= 0 ~t2_pc~0)) (.cse24 (= ~m_pc~0 0)) (.cse3 (= 2 ~t2_st~0)) (.cse19 (not .cse14)) (.cse23 (= 0 ~t3_st~0)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse20 (<= ~token~0 .cse25)) (.cse4 (= ~E_3~0 2)) (.cse21 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse22 (<= .cse25 ~token~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse17 (= 0 ~t2_st~0)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2)) (.cse11 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse17 .cse18 .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse19 .cse20 .cse4 .cse21 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse11 .cse17 .cse18 .cse13 .cse23) (and .cse0 .cse7 .cse8 .cse9 .cse24 .cse10 .cse18 .cse13 .cse23) (and .cse0 .cse2 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse17 .cse18 .cse13 .cse23 .cse15) (and .cse0 .cse7 .cse8 .cse24 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse23 .cse15) (and .cse2 (or (and .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse17 .cse18 .cse13 .cse14) (and .cse0 .cse1 .cse20 .cse4 .cse21 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse17 .cse12 .cse13 .cse14)) .cse11)))) [2021-10-29 04:52:17,070 INFO L853 garLoopResultBuilder]: At program point L268-3(lines 256 270) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse8 (= 0 ~t3_st~0)) (.cse4 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse18 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse19 (= 2 ~t1_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse13 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse14 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse5 (= ~E_M~0 2)) (.cse15 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (= ~E_1~0 2)) (.cse16 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (let ((.cse17 (+ 2 ~local~0))) (let ((.cse9 (<= .cse17 ~token~0)) (.cse10 (<= ~token~0 .cse17))) (or (and .cse0 .cse9 .cse10 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse5 .cse15 .cse7 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 1) .cse16) (and .cse0 .cse9 .cse10 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse5 .cse6 .cse7 .cse8 .cse16)))) .cse18 .cse19) (and .cse0 .cse18 (not .cse16) .cse19 .cse11 .cse12 .cse1 .cse13 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse7 .cse16) (and .cse0 (= 2 ~t3_st~0) .cse18 .cse19 (not (= ~E_3~0 1)) .cse11 .cse12 .cse1 .cse13 .cse2 .cse3 .cse14 .cse5 .cse15 .cse7 .cse16))) [2021-10-29 04:52:17,070 INFO L853 garLoopResultBuilder]: At program point L268-4(lines 256 270) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t2_st~0)) (.cse10 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t3_st~0)) (.cse11 (= ~E_3~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse3 (not (= ~E_M~0 0))) (.cse14 (= ~E_2~0 2)) (.cse5 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse7 (= ~t3_pc~0 1)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse8 (<= (+ 3 ~local~0) ~token~0) .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse3 .cse14 .cse5 .cse6 .cse7 (< ~token~0 (+ ~local~0 4)) .cse15))) [2021-10-29 04:52:17,071 INFO L853 garLoopResultBuilder]: At program point L268-5(lines 256 270) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-29 04:52:17,071 INFO L853 garLoopResultBuilder]: At program point L268-6(lines 256 270) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-29 04:52:17,071 INFO L853 garLoopResultBuilder]: At program point L139-1(lines 127 158) the Hoare annotation is: (let ((.cse17 (< 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse27 (= 2 ~t3_st~0)) (.cse11 (not (= ~E_3~0 1))) (.cse12 (= ~m_pc~0 1)) (.cse2 (not (= ~m_st~0 0))) (.cse29 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse4 (= ~E_M~0 2)) (.cse24 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse25 (= ~t3_pc~0 1))) (let ((.cse28 (= ~m_st~0 2)) (.cse18 (= ~E_3~0 ~E_1~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t1_st~0)) (.cse30 (or (and .cse0 .cse27 .cse17 .cse11 .cse12 .cse2 .cse4 .cse24 .cse6 .cse25) (and .cse0 .cse27 .cse11 .cse12 .cse2 .cse29 .cse4 .cse24 .cse6 .cse25))) (.cse1 (not .cse25)) (.cse10 (= ~E_3~0 2)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (= ~E_2~0 2)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (= 0 ~t3_st~0)) (.cse15 (not .cse0)) (.cse16 (= ~t1_st~0 0)) (.cse3 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse10 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse15 .cse16 .cse17 .cse18 .cse14 .cse3 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7) (and .cse8 .cse9 (let ((.cse26 (+ 2 ~local~0))) (let ((.cse21 (<= .cse26 ~token~0)) (.cse22 (<= ~token~0 .cse26)) (.cse23 (= ~t2_pc~0 1))) (or (and .cse0 .cse21 .cse22 .cse10 .cse23 .cse12 .cse14 .cse2 .cse4 .cse24 .cse6 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 1) .cse7 .cse25) (and .cse0 .cse21 .cse22 .cse10 .cse23 .cse12 .cse14 .cse2 .cse4 .cse5 .cse6 .cse7 .cse25))))) (and .cse27 .cse28 .cse10 .cse16 .cse17 .cse12 .cse13 .cse14 .cse4 .cse19 .cse20 .cse24 .cse6 .cse25) (and .cse9 .cse10 .cse14 (or (and .cse0 .cse27 .cse29 .cse3 .cse4 .cse24 .cse6 .cse25) (and .cse0 .cse27 .cse17 .cse3 .cse4 .cse24 .cse6 .cse25))) (and .cse10 .cse14 .cse19 .cse20 .cse30) (and .cse28 .cse1 .cse10 .cse16 .cse17 .cse12 .cse13 .cse14 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7) (and .cse27 .cse15 .cse16 .cse17 .cse18 .cse14 .cse3 .cse4 .cse19 .cse20 .cse24 .cse6 .cse25) (and .cse8 .cse9 .cse10 .cse14 .cse30) (and .cse0 .cse2 .cse3 .cse4 .cse24 .cse6 .cse25) (and .cse1 .cse15 .cse16 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7) (and .cse15 (<= 2 ~t3_st~0) .cse16 .cse17 .cse2 .cse3 .cse4 .cse24 .cse6 .cse25)))) [2021-10-29 04:52:17,072 INFO L853 garLoopResultBuilder]: At program point L73(lines 47 86) the Hoare annotation is: (let ((.cse11 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse2 (= 2 ~t2_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= ~t2_pc~0 1)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse1 (= 2 ~t3_st~0)) (.cse13 (not .cse0)) (.cse14 (= ~t1_st~0 0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse12 (not .cse11)) (.cse3 (= 2 ~t1_st~0)) (.cse15 (= ~E_3~0 ~E_1~0)) (.cse6 (= ~E_2~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse16 (= ~m_pc~0 0)) (.cse21 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse22 (= 0 ~t2_st~0)) (.cse19 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse10 (= ~E_1~0 2)) (.cse20 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ ~local~0 4))) (and .cse2 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse7 .cse16 .cse8 .cse17 .cse18 .cse19 .cse10 .cse20) (and .cse0 .cse1 .cse3 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse19 .cse10 .cse11) (and .cse1 .cse2 .cse13 .cse14 .cse5 .cse15 .cse6 .cse7 .cse16 .cse8 .cse17 .cse18 .cse19 .cse10 .cse11) (and .cse0 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse19 .cse10 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse13 .cse14 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse17 .cse18 .cse19 .cse10 .cse11) (and .cse12 .cse13 .cse14 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse17 .cse18 .cse19 .cse10 .cse20) (and .cse0 .cse12 .cse3 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse19 .cse10 .cse20)))) [2021-10-29 04:52:17,072 INFO L853 garLoopResultBuilder]: At program point L670-1(lines 465 707) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse17 (= ~t1_st~0 0)) (.cse18 (<= ~token~0 ~local~0)) (.cse19 (<= ~local~0 ~token~0)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse2 (not .cse12) (not .cse0) .cse17 (= ~E_3~0 ~E_1~0) .cse8 .cse9 .cse16 (= 0 ~t2_pc~0) .cse10 (= 0 ~t2_st~0) .cse18 .cse19 .cse11 (= 0 ~t3_st~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not .cse17) .cse18 .cse19 .cse11 .cse12 .cse13))) [2021-10-29 04:52:17,072 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-29 04:52:17,072 INFO L853 garLoopResultBuilder]: At program point L211(lines 199 213) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0)) [2021-10-29 04:52:17,073 INFO L853 garLoopResultBuilder]: At program point L211-1(lines 199 213) the Hoare annotation is: (let ((.cse17 (= ~t3_pc~0 1)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse15 (= 2 ~t3_st~0)) (.cse0 (= 2 ~t2_st~0)) (.cse2 (not .cse14)) (.cse4 (= ~t1_st~0 0)) (.cse5 (= ~t2_pc~0 1)) (.cse1 (not .cse17)) (.cse16 (= 2 ~t1_st~0)) (.cse3 (= ~E_3~0 2)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 2)) (.cse8 (not (= ~m_st~0 0))) (.cse18 (= 0 ~t2_pc~0)) (.cse9 (= ~E_M~0 2)) (.cse19 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse0 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse17) (and .cse14 .cse15 .cse16 .cse3 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse17) (and .cse14 .cse0 .cse1 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17) (and .cse14 .cse1 .cse16 .cse3 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13)))) [2021-10-29 04:52:17,073 INFO L853 garLoopResultBuilder]: At program point L211-2(lines 199 213) the Hoare annotation is: (let ((.cse21 (+ ~local~0 1)) (.cse19 (= ~t3_pc~0 1))) (let ((.cse2 (not .cse19)) (.cse1 (= 2 ~t2_st~0)) (.cse3 (<= ~token~0 .cse21)) (.cse5 (= ~t2_pc~0 1)) (.cse8 (<= .cse21 ~token~0)) (.cse18 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse14 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse20 (= 2 ~t3_st~0)) (.cse4 (= ~E_3~0 2)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse15 (= 0 ~t2_pc~0)) (.cse10 (= ~E_M~0 2)) (.cse11 (not (= ~t1_st~0 0))) (.cse16 (= 0 ~t2_st~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse16 .cse12 .cse13 .cse14) (and .cse0 .cse7 .cse9 .cse17 .cse10 .cse18 .cse13 .cse19) (and .cse0 .cse20 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse19) (and .cse0 .cse7 .cse9 .cse17 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse20 .cse4 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse16 .cse12 .cse13 .cse19)))) [2021-10-29 04:52:17,073 INFO L853 garLoopResultBuilder]: At program point L211-3(lines 199 213) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse10 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t2_st~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse13 .cse2)) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse16 .cse13 .cse2) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse12 .cse13 .cse14))) [2021-10-29 04:52:17,073 INFO L853 garLoopResultBuilder]: At program point L211-4(lines 199 213) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse11 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t3_st~0)) (.cse7 (= ~m_pc~0 1)) (.cse9 (not (= ~E_M~0 0))) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2)) (.cse14 (= ~t3_pc~0 1)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse10 (= ~E_2~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse8 .cse9 .cse11 (= ~m_pc~0 0) .cse12 .cse13 .cse14) (and .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 (or (and .cse0 .cse4 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse7 .cse9 .cse12 .cse13 .cse14 (= ~E_M~0 1))) .cse3 .cse5 .cse6 .cse10 (< ~token~0 (+ ~local~0 4))))) [2021-10-29 04:52:17,074 INFO L853 garLoopResultBuilder]: At program point L211-5(lines 199 213) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse7 (= 2 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (= 2 ~t2_st~0)) (.cse9 (= 2 ~t1_st~0)) (.cse10 (= ~E_3~0 2)) (.cse11 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 2)) (.cse5 (= ~E_1~0 2)) (.cse6 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse10 .cse11 .cse13 .cse1 .cse12 .cse2 .cse4 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse6) (and .cse0 .cse7 .cse14 (<= (+ 3 ~local~0) ~token~0) .cse8 .cse9 .cse10 .cse11 .cse13 .cse12 .cse4 .cse5 .cse6 (< ~token~0 (+ ~local~0 4))) (and .cse0 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse13 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6))) [2021-10-29 04:52:17,074 INFO L853 garLoopResultBuilder]: At program point L211-6(lines 199 213) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-29 04:52:17,074 INFO L853 garLoopResultBuilder]: At program point L411(lines 338 416) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 0)) (.cse13 (not (= ~E_3~0 1))) (.cse11 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse6 (= ~E_2~0 2)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse10 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse13 .cse5 .cse14 .cse6 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse5 .cse14 .cse6 .cse11 .cse8 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse9 .cse10) (and .cse0 .cse1 .cse12 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse8 .cse9 .cse10 (< ~token~0 (+ ~local~0 4))))) [2021-10-29 04:52:17,074 INFO L857 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2021-10-29 04:52:17,075 INFO L857 garLoopResultBuilder]: For program point L349-1(lines 344 410) no Hoare annotation was computed. [2021-10-29 04:52:17,075 INFO L860 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-10-29 04:52:17,075 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,075 INFO L857 garLoopResultBuilder]: For program point L219-2(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,075 INFO L857 garLoopResultBuilder]: For program point L219-3(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,075 INFO L857 garLoopResultBuilder]: For program point L219-5(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,075 INFO L857 garLoopResultBuilder]: For program point L219-6(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,076 INFO L857 garLoopResultBuilder]: For program point L219-8(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,076 INFO L857 garLoopResultBuilder]: For program point L219-9(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,076 INFO L857 garLoopResultBuilder]: For program point L219-11(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,076 INFO L857 garLoopResultBuilder]: For program point L219-12(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,076 INFO L857 garLoopResultBuilder]: For program point L219-14(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,076 INFO L857 garLoopResultBuilder]: For program point L219-15(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,076 INFO L857 garLoopResultBuilder]: For program point L219-17(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,077 INFO L857 garLoopResultBuilder]: For program point L219-18(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,077 INFO L857 garLoopResultBuilder]: For program point L219-20(lines 219 228) no Hoare annotation was computed. [2021-10-29 04:52:17,077 INFO L857 garLoopResultBuilder]: For program point L220(lines 220 225) no Hoare annotation was computed. [2021-10-29 04:52:17,077 INFO L857 garLoopResultBuilder]: For program point L220-1(lines 220 225) no Hoare annotation was computed. [2021-10-29 04:52:17,077 INFO L857 garLoopResultBuilder]: For program point L220-2(lines 220 225) no Hoare annotation was computed. [2021-10-29 04:52:17,077 INFO L857 garLoopResultBuilder]: For program point L220-3(lines 220 225) no Hoare annotation was computed. [2021-10-29 04:52:17,077 INFO L857 garLoopResultBuilder]: For program point L220-4(lines 220 225) no Hoare annotation was computed. [2021-10-29 04:52:17,078 INFO L857 garLoopResultBuilder]: For program point L220-5(lines 220 225) no Hoare annotation was computed. [2021-10-29 04:52:17,078 INFO L857 garLoopResultBuilder]: For program point L220-6(lines 220 225) no Hoare annotation was computed. [2021-10-29 04:52:17,078 INFO L853 garLoopResultBuilder]: At program point L354(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse33 (+ ~local~0 1))) (let ((.cse29 (<= ~token~0 .cse33)) (.cse30 (<= .cse33 ~token~0)) (.cse0 (= ~m_st~0 2)) (.cse28 (<= 2 ~t3_st~0)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= 2 ~t1_st~0)) (.cse19 (not (= ~E_3~0 1))) (.cse25 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse32 (<= 2 ~t2_st~0)) (.cse22 (= 2 ~t2_st~0)) (.cse26 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse23 (= ~t2_pc~0 1)) (.cse27 (= ~E_3~0 ~E_1~0)) (.cse24 (= ~m_pc~0 0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse22 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse1 .cse26 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse18 .cse27 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse26 .cse28 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse16 .cse22 .cse26 .cse3 .cse23 .cse27 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse1 .cse26 .cse3 .cse27 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse17 .cse22 .cse1 .cse18 .cse2 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14) (and .cse16 .cse26 .cse3 .cse27 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse8 .cse25 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse16 .cse22 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse29 .cse18 .cse2 .cse23 .cse4 .cse30 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse18 .cse2 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse29 .cse18 .cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse23 .cse4 .cse5 .cse30 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse22 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse12 .cse13 .cse14) (let ((.cse31 (+ 2 ~local~0))) (and .cse15 .cse17 (<= .cse31 ~token~0) (<= ~token~0 .cse31) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14 .cse21)) (and .cse15 .cse22 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse20 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse26 .cse28 .cse3 .cse20 .cse24 .cse8 .cse32 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse22 .cse18 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 .cse21) (and .cse1 .cse3 .cse20 .cse24 .cse8 .cse32 .cse12 .cse13 .cse14) (and .cse22 .cse1 .cse26 .cse3 .cse23 .cse27 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-29 04:52:17,078 INFO L857 garLoopResultBuilder]: For program point L92(lines 92 100) no Hoare annotation was computed. [2021-10-29 04:52:17,079 INFO L857 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2021-10-29 04:52:17,079 INFO L853 garLoopResultBuilder]: At program point L689(lines 689 698) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-29 04:52:17,079 INFO L853 garLoopResultBuilder]: At program point L689-1(lines 689 698) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-29 04:52:17,080 INFO L853 garLoopResultBuilder]: At program point L95(lines 95 99) the Hoare annotation is: (let ((.cse20 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1))) (let ((.cse26 (<= 2 ~t2_st~0)) (.cse22 (= ~E_3~0 ~E_1~0)) (.cse21 (not .cse15)) (.cse25 (<= 2 ~t3_st~0)) (.cse19 (= 2 ~t3_st~0)) (.cse0 (= ~m_st~0 2)) (.cse17 (= 0 ~t2_pc~0)) (.cse18 (= 0 ~t2_st~0)) (.cse23 (= ~m_pc~0 0)) (.cse24 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse1 (= 2 ~t2_st~0)) (.cse2 (not .cse20)) (.cse3 (= ~E_3~0 2)) (.cse4 (= ~t2_pc~0 1)) (.cse5 (= ~m_pc~0 1)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 2)) (.cse16 (not (= ~m_st~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse9 .cse18 .cse12 .cse13 .cse14) (and .cse15 .cse19 .cse3 .cse5 .cse7 .cse16 .cse17 .cse8 .cse9 .cse18 .cse12 .cse13 .cse20) (and .cse19 .cse21 .cse22 .cse7 .cse23 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse16 .cse23 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse19 .cse1 .cse3 .cse4 .cse5 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse20) (and .cse2 .cse21 .cse16 .cse23 .cse17 .cse8 .cse18 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse21 .cse4 .cse22 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse21 .cse22 .cse7 .cse23 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse21 .cse25 .cse16 .cse23 .cse8 .cse26 .cse24 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse21 .cse16 .cse23 .cse8 .cse26 .cse12 .cse13 .cse14) (and .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse20) (and .cse19 .cse1 .cse21 .cse4 .cse22 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse20) (and .cse21 .cse25 .cse16 .cse23 .cse17 .cse8 .cse18 .cse12 .cse13 .cse20) (and .cse19 .cse0 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse16 .cse23 .cse8 .cse24 .cse13 .cse20) (and .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-29 04:52:17,080 INFO L853 garLoopResultBuilder]: At program point L230(lines 218 232) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= 0 ~t3_st~0)) [2021-10-29 04:52:17,080 INFO L853 garLoopResultBuilder]: At program point L230-1(lines 218 232) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1)) (.cse14 (= ~t3_pc~0 1))) (let ((.cse19 (not .cse14)) (.cse17 (= 2 ~t1_st~0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse20 (= 0 ~t3_st~0)) (.cse0 (= 2 ~t3_st~0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (= 2 ~t2_st~0)) (.cse2 (not .cse15)) (.cse3 (= ~E_3~0 2)) (.cse4 (= ~t1_st~0 0)) (.cse18 (= ~t2_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse9 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ULTIMATE.start_eval_~tmp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse16 .cse17 .cse3 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse14) (and .cse15 .cse0 .cse17 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse16 .cse19 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse16 .cse19 .cse17 .cse3 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20) (and .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse19 .cse17 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14)))) [2021-10-29 04:52:17,080 INFO L853 garLoopResultBuilder]: At program point L230-2(lines 218 232) the Hoare annotation is: (let ((.cse22 (+ ~local~0 1)) (.cse13 (= ~t3_pc~0 1))) (let ((.cse7 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse14 (not .cse13)) (.cse20 (= ~m_pc~0 0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse15 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (= 2 ~t2_st~0)) (.cse17 (<= ~token~0 .cse22)) (.cse3 (= ~E_3~0 2)) (.cse18 (= ~t2_pc~0 1)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (<= .cse22 ~token~0)) (.cse6 (not (= ~m_st~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse21 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15) (and .cse0 .cse2 .cse16 .cse14 .cse17 .cse3 .cse18 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse11 .cse12 .cse15) (and .cse0 .cse5 .cse6 .cse20 .cse8 .cse21 .cse12 .cse13) (and .cse0 .cse5 .cse6 .cse20 .cse8 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse3 .cse18 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse21 .cse12 .cse13)))) [2021-10-29 04:52:17,081 INFO L857 garLoopResultBuilder]: For program point L164(lines 164 172) no Hoare annotation was computed. [2021-10-29 04:52:17,081 INFO L853 garLoopResultBuilder]: At program point L230-3(lines 218 232) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse10 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t2_st~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse13 .cse2)) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse16 .cse13 .cse2) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse12 .cse13 .cse14))) [2021-10-29 04:52:17,081 INFO L853 garLoopResultBuilder]: At program point L230-4(lines 218 232) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (< 0 ~t3_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse9 (not (= ~E_M~0 0))) (.cse10 (= ~E_2~0 2)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2)) (.cse14 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse8 .cse9 .cse11 (= ~m_pc~0 0) .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 (< ~token~0 (+ ~local~0 4))))) [2021-10-29 04:52:17,081 INFO L853 garLoopResultBuilder]: At program point L230-5(lines 218 232) the Hoare annotation is: (let ((.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 2)) (.cse13 (not (= ~m_st~0 0))) (.cse9 (= ~E_M~0 2)) (.cse10 (= ~E_1~0 2)) (.cse11 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse13 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse14 .cse12 .cse7 .cse13 .cse9 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse10 .cse11) (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse9 .cse10 .cse11 (< ~token~0 (+ ~local~0 4))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse12 .cse7 .cse13 .cse9 .cse10 .cse11))) [2021-10-29 04:52:17,082 INFO L853 garLoopResultBuilder]: At program point L230-6(lines 218 232) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-29 04:52:17,082 INFO L853 garLoopResultBuilder]: At program point L167(lines 167 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse28 (= ~t3_pc~0 1))) (let ((.cse12 (= ~m_st~0 2)) (.cse22 (= ~E_3~0 ~E_1~0)) (.cse24 (not (= ~E_3~0 1))) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse2 (not .cse28)) (.cse21 (not .cse0)) (.cse13 (= ~t1_st~0 0)) (.cse18 (= 0 ~t2_pc~0)) (.cse19 (= 0 ~t2_st~0)) (.cse20 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse4 (< 0 ~t3_st~0)) (.cse25 (not (= ~m_st~0 0))) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse13 .cse6 .cse14 .cse15 .cse7 .cse9 .cse16 .cse17 .cse10 .cse11) (and .cse12 .cse2 .cse4 .cse5 .cse13 .cse14 .cse15 .cse7 .cse18 .cse9 .cse19 .cse16 .cse17 .cse20 .cse11) (and .cse1 .cse2 .cse21 .cse4 .cse13 .cse6 .cse22 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse22 .cse7 .cse8 .cse18 .cse9 .cse19 .cse20 .cse11) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse14 .cse15 .cse7 .cse25 .cse9 .cse10 .cse11) (and .cse0 .cse23 .cse2 .cse3 .cse4 .cse5 .cse14 .cse15 .cse7 .cse25 .cse18 .cse9 .cse19 .cse20 .cse11) (and .cse2 .cse21 .cse4 .cse13 .cse22 .cse7 .cse8 .cse18 .cse9 .cse19 .cse16 .cse17 .cse20 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse24 .cse6 .cse14 .cse15 .cse7 .cse25 .cse9 .cse16 .cse17 .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse15 .cse7 .cse25 .cse18 .cse9 .cse19 .cse16 .cse17 .cse20 .cse11) (and .cse2 .cse21 .cse4 .cse13 .cse25 .cse8 .cse9 (<= 2 ~t2_st~0) .cse10 .cse11) (let ((.cse26 (+ ~local~0 1))) (and .cse0 .cse23 .cse2 (<= ~token~0 .cse26) .cse3 .cse4 .cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse6 .cse14 .cse15 (<= .cse26 ~token~0) .cse7 .cse25 .cse9 .cse19 .cse10 .cse11)) (let ((.cse27 (+ 2 ~local~0))) (and .cse0 .cse23 (<= .cse27 ~token~0) (<= ~token~0 .cse27) .cse1 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse9 .cse10 .cse11 .cse28)) (and .cse2 .cse21 .cse4 .cse13 .cse25 .cse8 .cse18 .cse9 .cse19 .cse20 .cse11) (and .cse0 .cse4 .cse25 .cse8 .cse9 .cse10 .cse11)))) [2021-10-29 04:52:17,085 INFO L731 BasicCegarLoop]: Path program 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] [2021-10-29 04:52:17,087 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 04:52:17,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 04:52:17 BoogieIcfgContainer [2021-10-29 04:52:17,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 04:52:17,230 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 04:52:17,230 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 04:52:17,230 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 04:52:17,231 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:36" (3/4) ... [2021-10-29 04:52:17,234 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-29 04:52:17,269 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 140 nodes and edges [2021-10-29 04:52:17,271 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-10-29 04:52:17,275 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-29 04:52:17,277 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-29 04:52:17,525 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 04:52:17,525 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 04:52:17,527 INFO L168 Benchmark]: Toolchain (without parser) took 103730.71 ms. Allocated memory was 86.0 MB in the beginning and 2.4 GB in the end (delta: 2.4 GB). Free memory was 50.8 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. [2021-10-29 04:52:17,528 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 86.0 MB. Free memory was 57.8 MB in the beginning and 57.8 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:52:17,529 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.86 ms. Allocated memory was 86.0 MB in the beginning and 111.1 MB in the end (delta: 25.2 MB). Free memory was 50.7 MB in the beginning and 83.0 MB in the end (delta: -32.3 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:17,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.92 ms. Allocated memory is still 111.1 MB. Free memory was 83.0 MB in the beginning and 79.1 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:17,530 INFO L168 Benchmark]: Boogie Preprocessor took 52.61 ms. Allocated memory is still 111.1 MB. Free memory was 79.1 MB in the beginning and 76.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:17,531 INFO L168 Benchmark]: RCFGBuilder took 1883.88 ms. Allocated memory is still 111.1 MB. Free memory was 76.0 MB in the beginning and 55.8 MB in the end (delta: 20.2 MB). Peak memory consumption was 30.7 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:17,531 INFO L168 Benchmark]: TraceAbstraction took 100992.29 ms. Allocated memory was 111.1 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 55.5 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. [2021-10-29 04:52:17,532 INFO L168 Benchmark]: Witness Printer took 295.20 ms. Allocated memory is still 2.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-10-29 04:52:17,541 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.23 ms. Allocated memory is still 86.0 MB. Free memory was 57.8 MB in the beginning and 57.8 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 434.86 ms. Allocated memory was 86.0 MB in the beginning and 111.1 MB in the end (delta: 25.2 MB). Free memory was 50.7 MB in the beginning and 83.0 MB in the end (delta: -32.3 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.92 ms. Allocated memory is still 111.1 MB. Free memory was 83.0 MB in the beginning and 79.1 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.61 ms. Allocated memory is still 111.1 MB. Free memory was 79.1 MB in the beginning and 76.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1883.88 ms. Allocated memory is still 111.1 MB. Free memory was 76.0 MB in the beginning and 55.8 MB in the end (delta: 20.2 MB). Peak memory consumption was 30.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 100992.29 ms. Allocated memory was 111.1 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 55.5 MB in the beginning and 1.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.1 GB. * Witness Printer took 295.20 ms. Allocated memory is still 2.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 30.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 100.7s, OverallIterations: 31, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 60.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7575 SDtfs, 10257 SDslu, 11528 SDs, 0 SdLazy, 2003 SolverSat, 475 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1907 GetRequests, 1725 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10124occurred in iteration=10, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 33745 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 46 PreInvPairs, 1402 NumberOfFragments, 16803 HoareAnnotationTreeSize, 46 FomulaSimplifications, 8469378 FormulaSimplificationTreeSizeReduction, 18.9s HoareSimplificationTime, 46 FomulaSimplificationsInter, 637506 FormulaSimplificationTreeSizeReductionInter, 41.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 3230 NumberOfCodeBlocks, 3230 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4008 ConstructedInterpolants, 0 QuantifiedInterpolants, 9477 SizeOfPredicates, 40 NumberOfNonLiveVariables, 3923 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 51 InterpolantComputations, 40 PerfectInterpolantSequences, 959/989 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((2 == t3_st && __retres1 == 0) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 == t3_st && __retres1 == 0) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((m_pc == t1_pc && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((__retres1 == 0 && m_pc == t1_pc) && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) && __retres1 == 0 - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((__retres1 == 0 && 2 == t1_st) && ((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((!(t3_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((__retres1 == 0 && m_pc == t1_pc) && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || (((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && 0 < t2_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((__retres1 == 0 && 2 == t1_st) && ((((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 1) && 0 == t3_st) && t3_pc == 1) || ((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)))) || (((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((2 == t1_st && E_3 == 2) && E_2 == 2) && ((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((t1_pc == 1 && 2 == t3_st) && 0 < t2_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || ((((E_3 == 2 && E_2 == 2) && token <= local) && local <= token) && ((((((((((t1_pc == 1 && 2 == t3_st) && 0 < t2_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((t1_pc == 1 && 2 == t3_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || (((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && 0 < t2_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((__retres1 == 0 && 2 == t1_st) && E_3 == 2) && E_2 == 2) && ((((((((((t1_pc == 1 && 2 == t3_st) && 0 < t2_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((t1_pc == 1 && 2 == t3_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((2 == t3_st && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((2 == t2_st && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((__retres1 == 0 && (((((((((((((2 == t3_st && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || (((((((((((((2 == t3_st && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1))) && !(t1_st == 0))) || (((((((((((2 == t3_st && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((!(t3_pc == 1) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((((((((((!(t3_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((__retres1 == 0 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((__retres1 == 0 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((2 <= t3_st && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((!(t3_pc == 1) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((2 <= t3_st && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((2 == t3_st && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 655]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || (((((((t1_pc == 1 && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 1) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) && __retres1 == 0) && 2 == t1_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((__retres1 == 0 && (((((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 1) && 0 == t3_st) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1))) && 2 == t1_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((!(t3_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || (((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((m_st == 2 && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || ((((((t1_pc == 1 && 0 < t3_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && !(t1_pc == 1)) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((!(t1_pc == 1) && 2 <= t3_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((!(t3_pc == 1) && !(t1_pc == 1)) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) || (((((((!(t1_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && 0 < t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((((m_st == 2 && 2 == t2_st) && 0 < t3_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && token < local + 4) && __retres1 == 0)) || ((((((((((((t1_pc == 1 && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((!(t1_pc == 1) && 0 < t3_st) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((((((m_st == 2 && 0 < t3_st) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((__retres1 == 0 && m_pc == t1_pc) && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) && __retres1 == 0 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || (((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && !(t3_pc == 1)) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && 0 == t3_st)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((!(t3_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((__retres1 == 0 && (((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1))) && !(t1_st == 0))) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((__retres1 == 0 && 3 + local <= token) && 2 == t2_st) && ((((((((t1_pc == 1 && 0 < t3_st) && m_pc == 1) && !(E_M == 0)) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((t1_pc == 1 && 0 < t3_st) && m_pc == 1) && !(E_M == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && E_M == 1))) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && token < local + 4) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 == t3_st && __retres1 == 0) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || ((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || ((((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || ((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) || ((((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4 - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((__retres1 == 0 && (((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1))) && !(t1_st == 0)) RESULT: Ultimate proved your program to be correct! [2021-10-29 04:52:17,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b7907bc-3462-48b6-a51f-8dcd9efeb0dc/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...