./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:41:40,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:41:40,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:41:40,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:41:40,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:41:40,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:41:40,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:41:40,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:41:40,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:41:40,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:41:40,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:41:40,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:41:40,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:41:40,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:41:40,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:41:40,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:41:40,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:41:40,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:41:40,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:41:40,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:41:40,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:41:40,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:41:40,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:41:40,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:41:40,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:41:40,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:41:40,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:41:40,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:41:40,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:41:40,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:41:40,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:41:40,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:41:40,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:41:40,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:41:40,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:41:40,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:41:40,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:41:40,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:41:40,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:41:40,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:41:40,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:41:40,434 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 17:41:40,458 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:41:40,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:41:40,459 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:41:40,459 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:41:40,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:41:40,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:41:40,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:41:40,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:41:40,460 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:41:40,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:41:40,461 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:41:40,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:41:40,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:41:40,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:41:40,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:41:40,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:41:40,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:41:40,462 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:41:40,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:41:40,462 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:41:40,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:41:40,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:41:40,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:41:40,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:41:40,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:41:40,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:41:40,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:41:40,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:41:40,463 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:41:40,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:41:40,463 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:41:40,464 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:41:40,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:41:40,464 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:41:40,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/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_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2021-12-06 17:41:40,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:41:40,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:41:40,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:41:40,670 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:41:40,670 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:41:40,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-12-06 17:41:40,713 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/data/fae31f959/67e7b8aa49904b958d53c4c4d2b8851a/FLAG6f7ce1efa [2021-12-06 17:41:41,077 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:41:41,077 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-12-06 17:41:41,084 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/data/fae31f959/67e7b8aa49904b958d53c4c4d2b8851a/FLAG6f7ce1efa [2021-12-06 17:41:41,094 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/data/fae31f959/67e7b8aa49904b958d53c4c4d2b8851a [2021-12-06 17:41:41,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:41:41,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:41:41,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:41:41,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:41:41,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:41:41,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c93bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41, skipping insertion in model container [2021-12-06 17:41:41,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:41:41,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:41:41,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2021-12-06 17:41:41,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:41:41,313 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:41:41,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2021-12-06 17:41:41,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:41:41,360 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:41:41,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41 WrapperNode [2021-12-06 17:41:41,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:41:41,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:41:41,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:41:41,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:41:41,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,403 INFO L137 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 273 [2021-12-06 17:41:41,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:41:41,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:41:41,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:41:41,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:41:41,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:41:41,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:41:41,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:41:41,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:41:41,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41" (1/1) ... [2021-12-06 17:41:41,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:41:41,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:41,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:41:41,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:41:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:41:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-06 17:41:41,498 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-06 17:41:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-06 17:41:41,499 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-06 17:41:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 17:41:41,499 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 17:41:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-06 17:41:41,500 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-06 17:41:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-06 17:41:41,500 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-06 17:41:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:41:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-06 17:41:41,500 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-06 17:41:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:41:41,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:41:41,560 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:41:41,562 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:41:41,808 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:41:41,816 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:41:41,816 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-06 17:41:41,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:41:41 BoogieIcfgContainer [2021-12-06 17:41:41,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:41:41,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:41:41,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:41:41,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:41:41,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:41:41" (1/3) ... [2021-12-06 17:41:41,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbd974d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:41:41, skipping insertion in model container [2021-12-06 17:41:41,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:41" (2/3) ... [2021-12-06 17:41:41,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbd974d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:41:41, skipping insertion in model container [2021-12-06 17:41:41,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:41:41" (3/3) ... [2021-12-06 17:41:41,831 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2021-12-06 17:41:41,836 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:41:41,836 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 17:41:41,872 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:41:41,877 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 17:41:41,877 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 17:41:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 110 states have internal predecessors, (169), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-06 17:41:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:41:41,900 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:41,901 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 17:41:41,901 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:41,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1341411477, now seen corresponding path program 1 times [2021-12-06 17:41:41,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:41,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207440883] [2021-12-06 17:41:41,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:41,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:42,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:42,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207440883] [2021-12-06 17:41:42,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207440883] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:42,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:42,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:41:42,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963788805] [2021-12-06 17:41:42,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:42,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:41:42,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:42,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:41:42,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:41:42,140 INFO L87 Difference]: Start difference. First operand has 132 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 110 states have internal predecessors, (169), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:42,435 INFO L93 Difference]: Finished difference Result 289 states and 448 transitions. [2021-12-06 17:41:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:41:42,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:41:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:42,446 INFO L225 Difference]: With dead ends: 289 [2021-12-06 17:41:42,446 INFO L226 Difference]: Without dead ends: 159 [2021-12-06 17:41:42,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:42,452 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 284 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:42,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 347 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 17:41:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-06 17:41:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 127. [2021-12-06 17:41:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 104 states have (on average 1.4615384615384615) internal successors, (152), 105 states have internal predecessors, (152), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-12-06 17:41:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2021-12-06 17:41:42,497 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 67 [2021-12-06 17:41:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:42,498 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2021-12-06 17:41:42,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2021-12-06 17:41:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:41:42,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:42,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 17:41:42,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:41:42,501 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:42,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1139587543, now seen corresponding path program 1 times [2021-12-06 17:41:42,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:42,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795354169] [2021-12-06 17:41:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:42,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:42,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:42,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795354169] [2021-12-06 17:41:42,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795354169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:42,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:42,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:41:42,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469944831] [2021-12-06 17:41:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:42,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:41:42,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:41:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:41:42,603 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:43,049 INFO L93 Difference]: Finished difference Result 423 states and 631 transitions. [2021-12-06 17:41:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:41:43,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:41:43,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:43,054 INFO L225 Difference]: With dead ends: 423 [2021-12-06 17:41:43,055 INFO L226 Difference]: Without dead ends: 306 [2021-12-06 17:41:43,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:41:43,058 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 403 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:43,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 588 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:41:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-12-06 17:41:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 243. [2021-12-06 17:41:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 202 states have (on average 1.4752475247524752) internal successors, (298), 204 states have internal predecessors, (298), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2021-12-06 17:41:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 355 transitions. [2021-12-06 17:41:43,094 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 355 transitions. Word has length 67 [2021-12-06 17:41:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:43,095 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 355 transitions. [2021-12-06 17:41:43,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 355 transitions. [2021-12-06 17:41:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:41:43,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:43,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 17:41:43,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:41:43,098 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1628045733, now seen corresponding path program 1 times [2021-12-06 17:41:43,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:43,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890142966] [2021-12-06 17:41:43,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:43,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:43,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:43,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890142966] [2021-12-06 17:41:43,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890142966] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:43,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:43,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:41:43,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196071977] [2021-12-06 17:41:43,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:43,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:41:43,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:43,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:41:43,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:41:43,190 INFO L87 Difference]: Start difference. First operand 243 states and 355 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:43,690 INFO L93 Difference]: Finished difference Result 686 states and 1015 transitions. [2021-12-06 17:41:43,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:41:43,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:41:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:43,695 INFO L225 Difference]: With dead ends: 686 [2021-12-06 17:41:43,695 INFO L226 Difference]: Without dead ends: 453 [2021-12-06 17:41:43,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:41:43,699 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 393 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:43,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 916 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:41:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-12-06 17:41:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 352. [2021-12-06 17:41:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 293 states have (on average 1.4675767918088738) internal successors, (430), 296 states have internal predecessors, (430), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-06 17:41:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 511 transitions. [2021-12-06 17:41:43,739 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 511 transitions. Word has length 67 [2021-12-06 17:41:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:43,739 INFO L470 AbstractCegarLoop]: Abstraction has 352 states and 511 transitions. [2021-12-06 17:41:43,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 511 transitions. [2021-12-06 17:41:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:41:43,742 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:43,742 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 17:41:43,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 17:41:43,742 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -752026727, now seen corresponding path program 1 times [2021-12-06 17:41:43,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:43,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182590570] [2021-12-06 17:41:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:43,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:43,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:43,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182590570] [2021-12-06 17:41:43,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182590570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:43,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:43,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:41:43,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939732587] [2021-12-06 17:41:43,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:43,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:41:43,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:43,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:41:43,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:41:43,828 INFO L87 Difference]: Start difference. First operand 352 states and 511 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:44,369 INFO L93 Difference]: Finished difference Result 1072 states and 1579 transitions. [2021-12-06 17:41:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:41:44,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:41:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:44,373 INFO L225 Difference]: With dead ends: 1072 [2021-12-06 17:41:44,373 INFO L226 Difference]: Without dead ends: 730 [2021-12-06 17:41:44,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:41:44,375 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 425 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:44,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 654 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:41:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-12-06 17:41:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 571. [2021-12-06 17:41:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 476 states have (on average 1.4600840336134453) internal successors, (695), 481 states have internal predecessors, (695), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2021-12-06 17:41:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 828 transitions. [2021-12-06 17:41:44,410 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 828 transitions. Word has length 67 [2021-12-06 17:41:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:44,411 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 828 transitions. [2021-12-06 17:41:44,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:44,411 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 828 transitions. [2021-12-06 17:41:44,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:41:44,412 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:44,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 17:41:44,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 17:41:44,413 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash -308126053, now seen corresponding path program 1 times [2021-12-06 17:41:44,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:44,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760304696] [2021-12-06 17:41:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:44,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:44,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:44,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:44,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:44,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:44,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760304696] [2021-12-06 17:41:44,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760304696] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:44,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:44,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:41:44,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195507850] [2021-12-06 17:41:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:44,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:41:44,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:41:44,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:41:44,480 INFO L87 Difference]: Start difference. First operand 571 states and 828 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:45,044 INFO L93 Difference]: Finished difference Result 1916 states and 2810 transitions. [2021-12-06 17:41:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:41:45,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:41:45,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:45,055 INFO L225 Difference]: With dead ends: 1916 [2021-12-06 17:41:45,055 INFO L226 Difference]: Without dead ends: 1355 [2021-12-06 17:41:45,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:41:45,059 INFO L933 BasicCegarLoop]: 296 mSDtfsCounter, 399 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:45,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 910 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:41:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2021-12-06 17:41:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 983. [2021-12-06 17:41:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 820 states have (on average 1.4573170731707317) internal successors, (1195), 829 states have internal predecessors, (1195), 100 states have call successors, (100), 54 states have call predecessors, (100), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2021-12-06 17:41:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1430 transitions. [2021-12-06 17:41:45,114 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1430 transitions. Word has length 67 [2021-12-06 17:41:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:45,114 INFO L470 AbstractCegarLoop]: Abstraction has 983 states and 1430 transitions. [2021-12-06 17:41:45,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1430 transitions. [2021-12-06 17:41:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:41:45,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:45,116 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 17:41:45,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 17:41:45,117 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:45,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1958255133, now seen corresponding path program 1 times [2021-12-06 17:41:45,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:45,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040836915] [2021-12-06 17:41:45,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:45,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:45,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:45,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040836915] [2021-12-06 17:41:45,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040836915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:45,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:45,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:41:45,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318711280] [2021-12-06 17:41:45,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:45,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:41:45,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:45,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:41:45,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:41:45,182 INFO L87 Difference]: Start difference. First operand 983 states and 1430 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:45,764 INFO L93 Difference]: Finished difference Result 3314 states and 4850 transitions. [2021-12-06 17:41:45,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 17:41:45,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:41:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:45,781 INFO L225 Difference]: With dead ends: 3314 [2021-12-06 17:41:45,781 INFO L226 Difference]: Without dead ends: 2341 [2021-12-06 17:41:45,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 17:41:45,786 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 404 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:45,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 882 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:41:45,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2021-12-06 17:41:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 1820. [2021-12-06 17:41:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1525 states have (on average 1.459016393442623) internal successors, (2225), 1542 states have internal predecessors, (2225), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2021-12-06 17:41:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2674 transitions. [2021-12-06 17:41:45,918 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2674 transitions. Word has length 67 [2021-12-06 17:41:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:45,919 INFO L470 AbstractCegarLoop]: Abstraction has 1820 states and 2674 transitions. [2021-12-06 17:41:45,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2674 transitions. [2021-12-06 17:41:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-12-06 17:41:45,921 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:45,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 17:41:45,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 17:41:45,921 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:45,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:45,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1477174875, now seen corresponding path program 1 times [2021-12-06 17:41:45,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:45,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114516627] [2021-12-06 17:41:45,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:45,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:41:45,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:45,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114516627] [2021-12-06 17:41:45,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114516627] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:45,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:41:45,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 17:41:45,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377139166] [2021-12-06 17:41:45,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:45,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 17:41:45,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:45,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 17:41:45,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 17:41:45,978 INFO L87 Difference]: Start difference. First operand 1820 states and 2674 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:46,526 INFO L93 Difference]: Finished difference Result 5157 states and 7617 transitions. [2021-12-06 17:41:46,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 17:41:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2021-12-06 17:41:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:46,549 INFO L225 Difference]: With dead ends: 5157 [2021-12-06 17:41:46,549 INFO L226 Difference]: Without dead ends: 3348 [2021-12-06 17:41:46,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-06 17:41:46,558 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 527 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:46,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 722 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:41:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3348 states. [2021-12-06 17:41:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3348 to 2761. [2021-12-06 17:41:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2308 states have (on average 1.441941074523397) internal successors, (3328), 2342 states have internal predecessors, (3328), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2021-12-06 17:41:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3997 transitions. [2021-12-06 17:41:46,710 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3997 transitions. Word has length 67 [2021-12-06 17:41:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:46,711 INFO L470 AbstractCegarLoop]: Abstraction has 2761 states and 3997 transitions. [2021-12-06 17:41:46,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 17:41:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3997 transitions. [2021-12-06 17:41:46,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-06 17:41:46,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:46,717 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2021-12-06 17:41:46,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 17:41:46,718 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:46,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1191841586, now seen corresponding path program 1 times [2021-12-06 17:41:46,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:46,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189016477] [2021-12-06 17:41:46,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:46,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:46,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:46,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 17:41:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:46,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:46,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 17:41:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 17:41:46,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:46,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189016477] [2021-12-06 17:41:46,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189016477] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:46,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160404669] [2021-12-06 17:41:46,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:46,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:46,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:46,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:46,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 17:41:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:46,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:41:46,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 17:41:47,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:41:47,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160404669] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:47,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:41:47,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 17:41:47,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912540475] [2021-12-06 17:41:47,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:47,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:41:47,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:47,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:41:47,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:47,032 INFO L87 Difference]: Start difference. First operand 2761 states and 3997 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:41:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:47,199 INFO L93 Difference]: Finished difference Result 8118 states and 11831 transitions. [2021-12-06 17:41:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:41:47,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 109 [2021-12-06 17:41:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:47,232 INFO L225 Difference]: With dead ends: 8118 [2021-12-06 17:41:47,232 INFO L226 Difference]: Without dead ends: 5368 [2021-12-06 17:41:47,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:47,240 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 140 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:47,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 350 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:41:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5368 states. [2021-12-06 17:41:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5368 to 5314. [2021-12-06 17:41:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5314 states, 4447 states have (on average 1.440746570721835) internal successors, (6407), 4514 states have internal predecessors, (6407), 510 states have call successors, (510), 308 states have call predecessors, (510), 356 states have return successors, (745), 507 states have call predecessors, (745), 510 states have call successors, (745) [2021-12-06 17:41:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5314 states to 5314 states and 7662 transitions. [2021-12-06 17:41:47,455 INFO L78 Accepts]: Start accepts. Automaton has 5314 states and 7662 transitions. Word has length 109 [2021-12-06 17:41:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:47,456 INFO L470 AbstractCegarLoop]: Abstraction has 5314 states and 7662 transitions. [2021-12-06 17:41:47,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 17:41:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5314 states and 7662 transitions. [2021-12-06 17:41:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-06 17:41:47,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:47,466 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2021-12-06 17:41:47,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:41:47,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:47,667 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:47,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1024502098, now seen corresponding path program 1 times [2021-12-06 17:41:47,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:47,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865814829] [2021-12-06 17:41:47,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:47,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:47,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:47,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:47,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:47,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:47,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 17:41:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:47,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:47,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 17:41:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 17:41:47,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:47,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865814829] [2021-12-06 17:41:47,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865814829] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:47,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588633156] [2021-12-06 17:41:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:47,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:47,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:47,761 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:47,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 17:41:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:47,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:41:47,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:41:47,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:41:47,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588633156] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:47,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:41:47,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:41:47,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108174510] [2021-12-06 17:41:47,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:47,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:41:47,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:47,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:41:47,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:47,937 INFO L87 Difference]: Start difference. First operand 5314 states and 7662 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:41:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:48,143 INFO L93 Difference]: Finished difference Result 8992 states and 13074 transitions. [2021-12-06 17:41:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:41:48,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 109 [2021-12-06 17:41:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:48,184 INFO L225 Difference]: With dead ends: 8992 [2021-12-06 17:41:48,185 INFO L226 Difference]: Without dead ends: 7065 [2021-12-06 17:41:48,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:48,190 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 143 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:48,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 511 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:41:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7065 states. [2021-12-06 17:41:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7065 to 7065. [2021-12-06 17:41:48,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7065 states, 5917 states have (on average 1.4402568869359473) internal successors, (8522), 6000 states have internal predecessors, (8522), 671 states have call successors, (671), 412 states have call predecessors, (671), 476 states have return successors, (1015), 668 states have call predecessors, (1015), 671 states have call successors, (1015) [2021-12-06 17:41:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7065 states to 7065 states and 10208 transitions. [2021-12-06 17:41:48,454 INFO L78 Accepts]: Start accepts. Automaton has 7065 states and 10208 transitions. Word has length 109 [2021-12-06 17:41:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:48,454 INFO L470 AbstractCegarLoop]: Abstraction has 7065 states and 10208 transitions. [2021-12-06 17:41:48,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:41:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7065 states and 10208 transitions. [2021-12-06 17:41:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-06 17:41:48,471 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:48,471 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:41:48,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 17:41:48,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:48,672 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:48,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1008937151, now seen corresponding path program 1 times [2021-12-06 17:41:48,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:48,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493538340] [2021-12-06 17:41:48,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:48,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 17:41:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 17:41:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-06 17:41:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-12-06 17:41:48,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:48,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493538340] [2021-12-06 17:41:48,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493538340] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:48,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700894157] [2021-12-06 17:41:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:48,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:48,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:48,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:48,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 17:41:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:48,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:41:48,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:41:49,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:41:49,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700894157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:49,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:41:49,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 17:41:49,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557383953] [2021-12-06 17:41:49,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:49,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:41:49,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:49,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:41:49,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:49,103 INFO L87 Difference]: Start difference. First operand 7065 states and 10208 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 17:41:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:49,459 INFO L93 Difference]: Finished difference Result 20891 states and 30410 transitions. [2021-12-06 17:41:49,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:41:49,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 141 [2021-12-06 17:41:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:49,516 INFO L225 Difference]: With dead ends: 20891 [2021-12-06 17:41:49,516 INFO L226 Difference]: Without dead ends: 13837 [2021-12-06 17:41:49,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:49,535 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 98 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:49,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 359 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:41:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13837 states. [2021-12-06 17:41:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13837 to 13695. [2021-12-06 17:41:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13695 states, 11460 states have (on average 1.4361256544502619) internal successors, (16458), 11625 states have internal predecessors, (16458), 1291 states have call successors, (1291), 815 states have call predecessors, (1291), 943 states have return successors, (1949), 1270 states have call predecessors, (1949), 1291 states have call successors, (1949) [2021-12-06 17:41:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13695 states to 13695 states and 19698 transitions. [2021-12-06 17:41:50,134 INFO L78 Accepts]: Start accepts. Automaton has 13695 states and 19698 transitions. Word has length 141 [2021-12-06 17:41:50,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:50,135 INFO L470 AbstractCegarLoop]: Abstraction has 13695 states and 19698 transitions. [2021-12-06 17:41:50,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 17:41:50,135 INFO L276 IsEmpty]: Start isEmpty. Operand 13695 states and 19698 transitions. [2021-12-06 17:41:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-06 17:41:50,169 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:50,170 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:41:50,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 17:41:50,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:50,370 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:50,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1723827082, now seen corresponding path program 1 times [2021-12-06 17:41:50,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:50,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286651339] [2021-12-06 17:41:50,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:50,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-06 17:41:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 17:41:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-06 17:41:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-06 17:41:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-06 17:41:50,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:50,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286651339] [2021-12-06 17:41:50,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286651339] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:50,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571998889] [2021-12-06 17:41:50,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:50,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:50,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:50,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:50,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 17:41:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:50,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:41:50,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-06 17:41:50,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:41:50,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571998889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:50,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:41:50,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:41:50,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020734905] [2021-12-06 17:41:50,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:50,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:41:50,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:50,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:41:50,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:50,781 INFO L87 Difference]: Start difference. First operand 13695 states and 19698 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:41:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:51,320 INFO L93 Difference]: Finished difference Result 29008 states and 42364 transitions. [2021-12-06 17:41:51,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:41:51,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 158 [2021-12-06 17:41:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:51,369 INFO L225 Difference]: With dead ends: 29008 [2021-12-06 17:41:51,369 INFO L226 Difference]: Without dead ends: 15323 [2021-12-06 17:41:51,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:51,410 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 116 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:51,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 212 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:41:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15323 states. [2021-12-06 17:41:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15323 to 15323. [2021-12-06 17:41:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15323 states, 12928 states have (on average 1.3779393564356435) internal successors, (17814), 13093 states have internal predecessors, (17814), 1336 states have call successors, (1336), 930 states have call predecessors, (1336), 1058 states have return successors, (1999), 1315 states have call predecessors, (1999), 1336 states have call successors, (1999) [2021-12-06 17:41:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15323 states to 15323 states and 21149 transitions. [2021-12-06 17:41:51,991 INFO L78 Accepts]: Start accepts. Automaton has 15323 states and 21149 transitions. Word has length 158 [2021-12-06 17:41:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:51,992 INFO L470 AbstractCegarLoop]: Abstraction has 15323 states and 21149 transitions. [2021-12-06 17:41:51,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:41:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 15323 states and 21149 transitions. [2021-12-06 17:41:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-06 17:41:52,015 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:52,015 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:41:52,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 17:41:52,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:52,216 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:52,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash -481856839, now seen corresponding path program 1 times [2021-12-06 17:41:52,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:52,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916185591] [2021-12-06 17:41:52,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:52,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-06 17:41:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 17:41:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-06 17:41:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2021-12-06 17:41:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-06 17:41:52,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:52,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916185591] [2021-12-06 17:41:52,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916185591] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:52,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138497427] [2021-12-06 17:41:52,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:52,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:52,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:52,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:52,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 17:41:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:52,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:41:52,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-06 17:41:52,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:41:52,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138497427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:52,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:41:52,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:41:52,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86364104] [2021-12-06 17:41:52,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:52,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:41:52,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:52,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:41:52,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:52,497 INFO L87 Difference]: Start difference. First operand 15323 states and 21149 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 17:41:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:52,955 INFO L93 Difference]: Finished difference Result 32174 states and 44325 transitions. [2021-12-06 17:41:52,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:41:52,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 158 [2021-12-06 17:41:52,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:52,996 INFO L225 Difference]: With dead ends: 32174 [2021-12-06 17:41:52,997 INFO L226 Difference]: Without dead ends: 16863 [2021-12-06 17:41:53,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:53,043 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 130 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:53,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 350 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:41:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16863 states. [2021-12-06 17:41:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16863 to 16723. [2021-12-06 17:41:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16723 states, 14216 states have (on average 1.342290377039955) internal successors, (19082), 14381 states have internal predecessors, (19082), 1356 states have call successors, (1356), 1022 states have call predecessors, (1356), 1150 states have return successors, (2111), 1335 states have call predecessors, (2111), 1356 states have call successors, (2111) [2021-12-06 17:41:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16723 states to 16723 states and 22549 transitions. [2021-12-06 17:41:53,771 INFO L78 Accepts]: Start accepts. Automaton has 16723 states and 22549 transitions. Word has length 158 [2021-12-06 17:41:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:53,771 INFO L470 AbstractCegarLoop]: Abstraction has 16723 states and 22549 transitions. [2021-12-06 17:41:53,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 17:41:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 16723 states and 22549 transitions. [2021-12-06 17:41:53,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-06 17:41:53,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:53,795 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:41:53,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 17:41:53,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-06 17:41:53,996 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1737479545, now seen corresponding path program 1 times [2021-12-06 17:41:53,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:53,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359281501] [2021-12-06 17:41:53,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:53,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 17:41:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 17:41:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 17:41:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 17:41:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-12-06 17:41:54,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:54,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359281501] [2021-12-06 17:41:54,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359281501] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:54,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906450752] [2021-12-06 17:41:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:54,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:54,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:54,104 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:54,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 17:41:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:54,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:41:54,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:54,277 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-06 17:41:54,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:41:54,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906450752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:54,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:41:54,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:41:54,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268256054] [2021-12-06 17:41:54,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:54,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:41:54,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:54,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:41:54,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:54,279 INFO L87 Difference]: Start difference. First operand 16723 states and 22549 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 17:41:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:55,109 INFO L93 Difference]: Finished difference Result 48048 states and 65401 transitions. [2021-12-06 17:41:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:41:55,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 159 [2021-12-06 17:41:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:55,180 INFO L225 Difference]: With dead ends: 48048 [2021-12-06 17:41:55,180 INFO L226 Difference]: Without dead ends: 31337 [2021-12-06 17:41:55,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:55,205 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 142 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:55,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 380 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:41:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31337 states. [2021-12-06 17:41:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31337 to 30845. [2021-12-06 17:41:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30845 states, 26113 states have (on average 1.333626929115766) internal successors, (34825), 26443 states have internal predecessors, (34825), 2571 states have call successors, (2571), 1904 states have call predecessors, (2571), 2160 states have return successors, (4678), 2529 states have call predecessors, (4678), 2571 states have call successors, (4678) [2021-12-06 17:41:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30845 states to 30845 states and 42074 transitions. [2021-12-06 17:41:56,342 INFO L78 Accepts]: Start accepts. Automaton has 30845 states and 42074 transitions. Word has length 159 [2021-12-06 17:41:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:56,342 INFO L470 AbstractCegarLoop]: Abstraction has 30845 states and 42074 transitions. [2021-12-06 17:41:56,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 17:41:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 30845 states and 42074 transitions. [2021-12-06 17:41:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-06 17:41:56,383 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:56,383 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:41:56,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 17:41:56,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-06 17:41:56,584 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:56,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2130014702, now seen corresponding path program 1 times [2021-12-06 17:41:56,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:56,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71366799] [2021-12-06 17:41:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:56,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 17:41:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 17:41:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 17:41:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 17:41:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-06 17:41:56,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:56,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71366799] [2021-12-06 17:41:56,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71366799] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:56,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727043758] [2021-12-06 17:41:56,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:56,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:56,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:56,665 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:56,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 17:41:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:56,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:41:56,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-06 17:41:56,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:41:56,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727043758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:56,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:41:56,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:41:56,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006725979] [2021-12-06 17:41:56,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:56,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:41:56,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:56,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:41:56,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:56,873 INFO L87 Difference]: Start difference. First operand 30845 states and 42074 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:41:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:41:57,907 INFO L93 Difference]: Finished difference Result 51820 states and 71648 transitions. [2021-12-06 17:41:57,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:41:57,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 159 [2021-12-06 17:41:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:41:57,971 INFO L225 Difference]: With dead ends: 51820 [2021-12-06 17:41:57,971 INFO L226 Difference]: Without dead ends: 27303 [2021-12-06 17:41:58,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:58,014 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 130 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:41:58,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 210 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:41:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27303 states. [2021-12-06 17:41:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27303 to 19855. [2021-12-06 17:41:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19855 states, 16907 states have (on average 1.2918909327497485) internal successors, (21842), 17081 states have internal predecessors, (21842), 1589 states have call successors, (1589), 1230 states have call predecessors, (1589), 1358 states have return successors, (2580), 1559 states have call predecessors, (2580), 1589 states have call successors, (2580) [2021-12-06 17:41:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19855 states to 19855 states and 26011 transitions. [2021-12-06 17:41:58,869 INFO L78 Accepts]: Start accepts. Automaton has 19855 states and 26011 transitions. Word has length 159 [2021-12-06 17:41:58,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:41:58,869 INFO L470 AbstractCegarLoop]: Abstraction has 19855 states and 26011 transitions. [2021-12-06 17:41:58,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:41:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 19855 states and 26011 transitions. [2021-12-06 17:41:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-06 17:41:58,886 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:41:58,886 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:41:58,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 17:41:59,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-06 17:41:59,088 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:41:59,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:41:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash 386447850, now seen corresponding path program 1 times [2021-12-06 17:41:59,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:41:59,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420797997] [2021-12-06 17:41:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:59,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:41:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:41:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:41:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:41:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:41:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:41:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 17:41:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 17:41:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 17:41:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:41:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 17:41:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-12-06 17:41:59,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:41:59,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420797997] [2021-12-06 17:41:59,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420797997] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:41:59,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418887235] [2021-12-06 17:41:59,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:41:59,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:41:59,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:41:59,191 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:41:59,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 17:41:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:41:59,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:41:59,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:41:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-06 17:41:59,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:41:59,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418887235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:41:59,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:41:59,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:41:59,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982166104] [2021-12-06 17:41:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:41:59,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:41:59,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:41:59,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:41:59,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:41:59,365 INFO L87 Difference]: Start difference. First operand 19855 states and 26011 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 17:42:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:00,479 INFO L93 Difference]: Finished difference Result 57698 states and 76509 transitions. [2021-12-06 17:42:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:00,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 159 [2021-12-06 17:42:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:00,567 INFO L225 Difference]: With dead ends: 57698 [2021-12-06 17:42:00,567 INFO L226 Difference]: Without dead ends: 37859 [2021-12-06 17:42:00,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:00,600 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 138 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:00,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 384 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:00,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37859 states. [2021-12-06 17:42:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37859 to 36831. [2021-12-06 17:42:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36831 states, 31241 states have (on average 1.2801126724496654) internal successors, (39992), 31589 states have internal predecessors, (39992), 3025 states have call successors, (3025), 2308 states have call predecessors, (3025), 2564 states have return successors, (5800), 2965 states have call predecessors, (5800), 3025 states have call successors, (5800) [2021-12-06 17:42:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36831 states to 36831 states and 48817 transitions. [2021-12-06 17:42:02,009 INFO L78 Accepts]: Start accepts. Automaton has 36831 states and 48817 transitions. Word has length 159 [2021-12-06 17:42:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:02,010 INFO L470 AbstractCegarLoop]: Abstraction has 36831 states and 48817 transitions. [2021-12-06 17:42:02,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-06 17:42:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 36831 states and 48817 transitions. [2021-12-06 17:42:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-06 17:42:02,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:02,044 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:42:02,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 17:42:02,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:02,245 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:02,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:02,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1954938935, now seen corresponding path program 1 times [2021-12-06 17:42:02,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:02,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398590147] [2021-12-06 17:42:02,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:02,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 17:42:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 17:42:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-12-06 17:42:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 17:42:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-12-06 17:42:02,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:02,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398590147] [2021-12-06 17:42:02,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398590147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:02,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:02,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:42:02,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331808089] [2021-12-06 17:42:02,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:02,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:42:02,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:02,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:02,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:02,328 INFO L87 Difference]: Start difference. First operand 36831 states and 48817 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:42:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:04,146 INFO L93 Difference]: Finished difference Result 72910 states and 95695 transitions. [2021-12-06 17:42:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:42:04,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 159 [2021-12-06 17:42:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:04,228 INFO L225 Difference]: With dead ends: 72910 [2021-12-06 17:42:04,228 INFO L226 Difference]: Without dead ends: 36094 [2021-12-06 17:42:04,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:04,282 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 281 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:04,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 310 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:42:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36094 states. [2021-12-06 17:42:05,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36094 to 33356. [2021-12-06 17:42:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33356 states, 28538 states have (on average 1.2772443759198262) internal successors, (36450), 29175 states have internal predecessors, (36450), 2307 states have call successors, (2307), 1772 states have call predecessors, (2307), 2510 states have return successors, (4765), 2424 states have call predecessors, (4765), 2307 states have call successors, (4765) [2021-12-06 17:42:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33356 states to 33356 states and 43522 transitions. [2021-12-06 17:42:05,762 INFO L78 Accepts]: Start accepts. Automaton has 33356 states and 43522 transitions. Word has length 159 [2021-12-06 17:42:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:05,762 INFO L470 AbstractCegarLoop]: Abstraction has 33356 states and 43522 transitions. [2021-12-06 17:42:05,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:42:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 33356 states and 43522 transitions. [2021-12-06 17:42:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-06 17:42:05,789 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:05,789 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:05,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 17:42:05,790 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:05,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:05,790 INFO L85 PathProgramCache]: Analyzing trace with hash 2077795372, now seen corresponding path program 1 times [2021-12-06 17:42:05,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:05,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874977216] [2021-12-06 17:42:05,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:05,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-06 17:42:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 17:42:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 17:42:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-06 17:42:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-06 17:42:05,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:05,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874977216] [2021-12-06 17:42:05,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874977216] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:05,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:05,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 17:42:05,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795794514] [2021-12-06 17:42:05,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:05,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:42:05,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:05,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:05,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 17:42:05,840 INFO L87 Difference]: Start difference. First operand 33356 states and 43522 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:42:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:07,035 INFO L93 Difference]: Finished difference Result 60854 states and 79171 transitions. [2021-12-06 17:42:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:42:07,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 159 [2021-12-06 17:42:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:07,085 INFO L225 Difference]: With dead ends: 60854 [2021-12-06 17:42:07,085 INFO L226 Difference]: Without dead ends: 27509 [2021-12-06 17:42:07,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:07,116 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 281 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:07,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 308 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:42:07,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27509 states. [2021-12-06 17:42:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27509 to 24900. [2021-12-06 17:42:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24900 states, 21348 states have (on average 1.2856005246393105) internal successors, (27445), 21794 states have internal predecessors, (27445), 1717 states have call successors, (1717), 1326 states have call predecessors, (1717), 1834 states have return successors, (3303), 1787 states have call predecessors, (3303), 1717 states have call successors, (3303) [2021-12-06 17:42:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24900 states to 24900 states and 32465 transitions. [2021-12-06 17:42:08,200 INFO L78 Accepts]: Start accepts. Automaton has 24900 states and 32465 transitions. Word has length 159 [2021-12-06 17:42:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:08,200 INFO L470 AbstractCegarLoop]: Abstraction has 24900 states and 32465 transitions. [2021-12-06 17:42:08,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 17:42:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 24900 states and 32465 transitions. [2021-12-06 17:42:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 17:42:08,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:08,222 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:08,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 17:42:08,222 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:08,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1097089037, now seen corresponding path program 1 times [2021-12-06 17:42:08,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:08,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043007742] [2021-12-06 17:42:08,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:08,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 17:42:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 17:42:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 17:42:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-06 17:42:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 17:42:08,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:08,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043007742] [2021-12-06 17:42:08,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043007742] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:08,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921433264] [2021-12-06 17:42:08,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:08,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:08,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:08,289 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:08,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 17:42:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:08,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:42:08,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 17:42:08,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:08,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921433264] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:08,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:08,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:42:08,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593681670] [2021-12-06 17:42:08,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:08,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:42:08,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:08,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:08,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:08,464 INFO L87 Difference]: Start difference. First operand 24900 states and 32465 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 17:42:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:09,433 INFO L93 Difference]: Finished difference Result 41871 states and 56180 transitions. [2021-12-06 17:42:09,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:09,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2021-12-06 17:42:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:09,482 INFO L225 Difference]: With dead ends: 41871 [2021-12-06 17:42:09,482 INFO L226 Difference]: Without dead ends: 25016 [2021-12-06 17:42:09,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:09,511 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 130 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:09,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 464 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25016 states. [2021-12-06 17:42:10,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25016 to 24900. [2021-12-06 17:42:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24900 states, 21348 states have (on average 1.2620854412591342) internal successors, (26943), 21794 states have internal predecessors, (26943), 1717 states have call successors, (1717), 1326 states have call predecessors, (1717), 1834 states have return successors, (3303), 1787 states have call predecessors, (3303), 1717 states have call successors, (3303) [2021-12-06 17:42:10,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24900 states to 24900 states and 31963 transitions. [2021-12-06 17:42:10,549 INFO L78 Accepts]: Start accepts. Automaton has 24900 states and 31963 transitions. Word has length 161 [2021-12-06 17:42:10,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:10,549 INFO L470 AbstractCegarLoop]: Abstraction has 24900 states and 31963 transitions. [2021-12-06 17:42:10,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 17:42:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 24900 states and 31963 transitions. [2021-12-06 17:42:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 17:42:10,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:10,571 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:42:10,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 17:42:10,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 17:42:10,772 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:10,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash 724411373, now seen corresponding path program 1 times [2021-12-06 17:42:10,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:10,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187499307] [2021-12-06 17:42:10,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:10,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 17:42:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 17:42:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 17:42:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-06 17:42:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 17:42:10,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:10,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187499307] [2021-12-06 17:42:10,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187499307] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:10,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030843864] [2021-12-06 17:42:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:10,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:10,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:10,850 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:10,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 17:42:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:10,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:42:10,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-06 17:42:11,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:11,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030843864] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:11,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:11,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:42:11,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923477923] [2021-12-06 17:42:11,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:11,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:42:11,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:11,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:11,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:11,010 INFO L87 Difference]: Start difference. First operand 24900 states and 31963 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:42:11,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:11,908 INFO L93 Difference]: Finished difference Result 46579 states and 60834 transitions. [2021-12-06 17:42:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:11,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 161 [2021-12-06 17:42:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:11,951 INFO L225 Difference]: With dead ends: 46579 [2021-12-06 17:42:11,951 INFO L226 Difference]: Without dead ends: 22842 [2021-12-06 17:42:11,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:11,984 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 151 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:11,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 208 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:11,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22842 states. [2021-12-06 17:42:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22842 to 21577. [2021-12-06 17:42:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21577 states, 18547 states have (on average 1.2259125465034777) internal successors, (22737), 18913 states have internal predecessors, (22737), 1469 states have call successors, (1469), 1138 states have call predecessors, (1469), 1560 states have return successors, (2633), 1529 states have call predecessors, (2633), 1469 states have call successors, (2633) [2021-12-06 17:42:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21577 states to 21577 states and 26839 transitions. [2021-12-06 17:42:12,903 INFO L78 Accepts]: Start accepts. Automaton has 21577 states and 26839 transitions. Word has length 161 [2021-12-06 17:42:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:12,903 INFO L470 AbstractCegarLoop]: Abstraction has 21577 states and 26839 transitions. [2021-12-06 17:42:12,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:42:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 21577 states and 26839 transitions. [2021-12-06 17:42:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-12-06 17:42:12,916 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:12,917 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:42:12,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 17:42:13,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:13,118 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:13,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:13,119 INFO L85 PathProgramCache]: Analyzing trace with hash 308777324, now seen corresponding path program 1 times [2021-12-06 17:42:13,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:13,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718576632] [2021-12-06 17:42:13,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:13,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 17:42:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 17:42:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-06 17:42:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-06 17:42:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-06 17:42:13,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:13,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718576632] [2021-12-06 17:42:13,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718576632] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:13,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181935371] [2021-12-06 17:42:13,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:13,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:13,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:13,192 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:13,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 17:42:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:13,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:42:13,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 17:42:13,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:13,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181935371] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:13,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:13,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:42:13,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564820916] [2021-12-06 17:42:13,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:13,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:42:13,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:13,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:13,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:13,383 INFO L87 Difference]: Start difference. First operand 21577 states and 26839 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 17:42:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:14,228 INFO L93 Difference]: Finished difference Result 37035 states and 47315 transitions. [2021-12-06 17:42:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:14,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2021-12-06 17:42:14,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:14,271 INFO L225 Difference]: With dead ends: 37035 [2021-12-06 17:42:14,271 INFO L226 Difference]: Without dead ends: 21679 [2021-12-06 17:42:14,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:14,296 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 123 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:14,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 467 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:14,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2021-12-06 17:42:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 21577. [2021-12-06 17:42:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21577 states, 18547 states have (on average 1.1985226721302638) internal successors, (22229), 18913 states have internal predecessors, (22229), 1469 states have call successors, (1469), 1138 states have call predecessors, (1469), 1560 states have return successors, (2633), 1529 states have call predecessors, (2633), 1469 states have call successors, (2633) [2021-12-06 17:42:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21577 states to 21577 states and 26331 transitions. [2021-12-06 17:42:15,255 INFO L78 Accepts]: Start accepts. Automaton has 21577 states and 26331 transitions. Word has length 161 [2021-12-06 17:42:15,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:15,256 INFO L470 AbstractCegarLoop]: Abstraction has 21577 states and 26331 transitions. [2021-12-06 17:42:15,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 17:42:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 21577 states and 26331 transitions. [2021-12-06 17:42:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-06 17:42:15,270 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:15,270 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:42:15,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 17:42:15,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:15,471 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:15,472 INFO L85 PathProgramCache]: Analyzing trace with hash -29438826, now seen corresponding path program 1 times [2021-12-06 17:42:15,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:15,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182765024] [2021-12-06 17:42:15,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:15,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 17:42:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 17:42:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 17:42:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-06 17:42:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 17:42:15,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:15,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182765024] [2021-12-06 17:42:15,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182765024] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:15,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344353423] [2021-12-06 17:42:15,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:15,556 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:15,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:15,557 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:15,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 17:42:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:15,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:42:15,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-06 17:42:15,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:15,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344353423] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:15,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:15,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:42:15,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337315474] [2021-12-06 17:42:15,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:15,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:42:15,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:15,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:15,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:15,706 INFO L87 Difference]: Start difference. First operand 21577 states and 26331 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:42:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:16,565 INFO L93 Difference]: Finished difference Result 35204 states and 44063 transitions. [2021-12-06 17:42:16,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:16,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 162 [2021-12-06 17:42:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:16,603 INFO L225 Difference]: With dead ends: 35204 [2021-12-06 17:42:16,603 INFO L226 Difference]: Without dead ends: 21625 [2021-12-06 17:42:16,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:16,628 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 144 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:16,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 435 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:16,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21625 states. [2021-12-06 17:42:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21625 to 21577. [2021-12-06 17:42:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21577 states, 18547 states have (on average 1.1848277349436567) internal successors, (21975), 18913 states have internal predecessors, (21975), 1469 states have call successors, (1469), 1138 states have call predecessors, (1469), 1560 states have return successors, (2633), 1529 states have call predecessors, (2633), 1469 states have call successors, (2633) [2021-12-06 17:42:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21577 states to 21577 states and 26077 transitions. [2021-12-06 17:42:17,570 INFO L78 Accepts]: Start accepts. Automaton has 21577 states and 26077 transitions. Word has length 162 [2021-12-06 17:42:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:17,570 INFO L470 AbstractCegarLoop]: Abstraction has 21577 states and 26077 transitions. [2021-12-06 17:42:17,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-06 17:42:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 21577 states and 26077 transitions. [2021-12-06 17:42:17,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-06 17:42:17,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:17,584 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:42:17,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:17,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-06 17:42:17,785 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1367110781, now seen corresponding path program 1 times [2021-12-06 17:42:17,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:17,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822204316] [2021-12-06 17:42:17,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 17:42:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-06 17:42:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-06 17:42:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-06 17:42:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-06 17:42:17,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:17,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822204316] [2021-12-06 17:42:17,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822204316] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:17,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963251543] [2021-12-06 17:42:17,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:17,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:17,853 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:17,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 17:42:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:17,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:42:17,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-06 17:42:18,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:18,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963251543] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:18,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:18,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:42:18,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795054576] [2021-12-06 17:42:18,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:18,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:42:18,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:18,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:18,013 INFO L87 Difference]: Start difference. First operand 21577 states and 26077 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 17:42:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:18,857 INFO L93 Difference]: Finished difference Result 36935 states and 44633 transitions. [2021-12-06 17:42:18,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:18,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 162 [2021-12-06 17:42:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:18,896 INFO L225 Difference]: With dead ends: 36935 [2021-12-06 17:42:18,896 INFO L226 Difference]: Without dead ends: 21579 [2021-12-06 17:42:18,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:18,918 INFO L933 BasicCegarLoop]: 308 mSDtfsCounter, 125 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:18,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 475 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21579 states. [2021-12-06 17:42:19,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21579 to 21577. [2021-12-06 17:42:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21577 states, 18547 states have (on average 1.1818622957890763) internal successors, (21920), 18913 states have internal predecessors, (21920), 1469 states have call successors, (1469), 1138 states have call predecessors, (1469), 1560 states have return successors, (2618), 1529 states have call predecessors, (2618), 1469 states have call successors, (2618) [2021-12-06 17:42:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21577 states to 21577 states and 26007 transitions. [2021-12-06 17:42:19,867 INFO L78 Accepts]: Start accepts. Automaton has 21577 states and 26007 transitions. Word has length 162 [2021-12-06 17:42:19,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:19,868 INFO L470 AbstractCegarLoop]: Abstraction has 21577 states and 26007 transitions. [2021-12-06 17:42:19,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 17:42:19,868 INFO L276 IsEmpty]: Start isEmpty. Operand 21577 states and 26007 transitions. [2021-12-06 17:42:19,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 17:42:19,881 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:19,881 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:42:19,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:20,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:20,082 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:20,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:20,083 INFO L85 PathProgramCache]: Analyzing trace with hash 646389301, now seen corresponding path program 1 times [2021-12-06 17:42:20,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:20,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776353334] [2021-12-06 17:42:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:20,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 17:42:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 17:42:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 17:42:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-06 17:42:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 17:42:20,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:20,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776353334] [2021-12-06 17:42:20,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776353334] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:20,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555837463] [2021-12-06 17:42:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:20,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:20,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:20,154 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:20,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 17:42:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:20,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:42:20,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-06 17:42:20,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:20,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555837463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:20,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:20,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 17:42:20,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462647575] [2021-12-06 17:42:20,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:20,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:42:20,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:20,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:20,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 17:42:20,365 INFO L87 Difference]: Start difference. First operand 21577 states and 26007 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:42:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:21,135 INFO L93 Difference]: Finished difference Result 29740 states and 36096 transitions. [2021-12-06 17:42:21,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 17:42:21,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 163 [2021-12-06 17:42:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:21,161 INFO L225 Difference]: With dead ends: 29740 [2021-12-06 17:42:21,161 INFO L226 Difference]: Without dead ends: 15790 [2021-12-06 17:42:21,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 17:42:21,180 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 174 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:21,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 317 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 17:42:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15790 states. [2021-12-06 17:42:21,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15790 to 15730. [2021-12-06 17:42:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15730 states, 13536 states have (on average 1.164524231678487) internal successors, (15763), 13783 states have internal predecessors, (15763), 1075 states have call successors, (1075), 828 states have call predecessors, (1075), 1118 states have return successors, (1857), 1120 states have call predecessors, (1857), 1075 states have call successors, (1857) [2021-12-06 17:42:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15730 states to 15730 states and 18695 transitions. [2021-12-06 17:42:21,898 INFO L78 Accepts]: Start accepts. Automaton has 15730 states and 18695 transitions. Word has length 163 [2021-12-06 17:42:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:21,898 INFO L470 AbstractCegarLoop]: Abstraction has 15730 states and 18695 transitions. [2021-12-06 17:42:21,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:42:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 15730 states and 18695 transitions. [2021-12-06 17:42:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 17:42:21,904 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:21,905 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:42:21,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 17:42:22,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-06 17:42:22,106 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:22,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:22,107 INFO L85 PathProgramCache]: Analyzing trace with hash -446245901, now seen corresponding path program 1 times [2021-12-06 17:42:22,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:22,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149356250] [2021-12-06 17:42:22,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:22,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 17:42:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 17:42:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 17:42:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-06 17:42:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 17:42:22,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149356250] [2021-12-06 17:42:22,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149356250] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716757302] [2021-12-06 17:42:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:22,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:22,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:22,171 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:22,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 17:42:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:22,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 17:42:22,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2021-12-06 17:42:22,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:22,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716757302] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:22,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:22,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 17:42:22,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213021234] [2021-12-06 17:42:22,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:22,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:42:22,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:22,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:22,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:42:22,333 INFO L87 Difference]: Start difference. First operand 15730 states and 18695 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:42:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:23,036 INFO L93 Difference]: Finished difference Result 29497 states and 35579 transitions. [2021-12-06 17:42:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:42:23,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 163 [2021-12-06 17:42:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:23,059 INFO L225 Difference]: With dead ends: 29497 [2021-12-06 17:42:23,059 INFO L226 Difference]: Without dead ends: 13778 [2021-12-06 17:42:23,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:42:23,075 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 87 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:23,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 688 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2021-12-06 17:42:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 13206. [2021-12-06 17:42:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13206 states, 11261 states have (on average 1.142438504573306) internal successors, (12865), 11470 states have internal predecessors, (12865), 956 states have call successors, (956), 736 states have call predecessors, (956), 988 states have return successors, (1571), 1001 states have call predecessors, (1571), 956 states have call successors, (1571) [2021-12-06 17:42:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13206 states to 13206 states and 15392 transitions. [2021-12-06 17:42:23,704 INFO L78 Accepts]: Start accepts. Automaton has 13206 states and 15392 transitions. Word has length 163 [2021-12-06 17:42:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:23,705 INFO L470 AbstractCegarLoop]: Abstraction has 13206 states and 15392 transitions. [2021-12-06 17:42:23,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:42:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 13206 states and 15392 transitions. [2021-12-06 17:42:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 17:42:23,709 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:23,710 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:42:23,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 17:42:23,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:23,911 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:23,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:23,912 INFO L85 PathProgramCache]: Analyzing trace with hash 795348478, now seen corresponding path program 1 times [2021-12-06 17:42:23,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:23,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54886028] [2021-12-06 17:42:23,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:23,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 17:42:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 17:42:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 17:42:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-06 17:42:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-06 17:42:23,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54886028] [2021-12-06 17:42:23,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54886028] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:23,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329987894] [2021-12-06 17:42:23,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:23,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:23,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:23,987 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:23,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 17:42:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:24,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 17:42:24,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2021-12-06 17:42:24,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:24,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329987894] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:24,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:24,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 17:42:24,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315497324] [2021-12-06 17:42:24,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:24,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:42:24,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:24,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:42:24,149 INFO L87 Difference]: Start difference. First operand 13206 states and 15392 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:42:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:24,790 INFO L93 Difference]: Finished difference Result 26361 states and 31178 transitions. [2021-12-06 17:42:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:42:24,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 163 [2021-12-06 17:42:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:24,813 INFO L225 Difference]: With dead ends: 26361 [2021-12-06 17:42:24,813 INFO L226 Difference]: Without dead ends: 13166 [2021-12-06 17:42:24,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:42:24,831 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 49 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:24,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 678 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13166 states. [2021-12-06 17:42:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13166 to 12726. [2021-12-06 17:42:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12726 states, 10805 states have (on average 1.121795465062471) internal successors, (12121), 10998 states have internal predecessors, (12121), 956 states have call successors, (956), 736 states have call predecessors, (956), 964 states have return successors, (1459), 993 states have call predecessors, (1459), 956 states have call successors, (1459) [2021-12-06 17:42:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12726 states to 12726 states and 14536 transitions. [2021-12-06 17:42:25,507 INFO L78 Accepts]: Start accepts. Automaton has 12726 states and 14536 transitions. Word has length 163 [2021-12-06 17:42:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:25,507 INFO L470 AbstractCegarLoop]: Abstraction has 12726 states and 14536 transitions. [2021-12-06 17:42:25,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:42:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12726 states and 14536 transitions. [2021-12-06 17:42:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-12-06 17:42:25,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:25,512 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:42:25,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-06 17:42:25,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:25,713 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:25,714 INFO L85 PathProgramCache]: Analyzing trace with hash -734104060, now seen corresponding path program 1 times [2021-12-06 17:42:25,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:25,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53781276] [2021-12-06 17:42:25,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:25,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 17:42:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 17:42:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 17:42:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-06 17:42:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-12-06 17:42:25,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:25,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53781276] [2021-12-06 17:42:25,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53781276] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:25,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100682899] [2021-12-06 17:42:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:25,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:25,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:25,818 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:25,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 17:42:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:25,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 17:42:25,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-06 17:42:26,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:26,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100682899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:26,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:26,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 17:42:26,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001498884] [2021-12-06 17:42:26,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:26,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 17:42:26,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:26,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 17:42:26,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:42:26,007 INFO L87 Difference]: Start difference. First operand 12726 states and 14536 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:42:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:26,533 INFO L93 Difference]: Finished difference Result 23245 states and 26881 transitions. [2021-12-06 17:42:26,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 17:42:26,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 163 [2021-12-06 17:42:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:26,550 INFO L225 Difference]: With dead ends: 23245 [2021-12-06 17:42:26,550 INFO L226 Difference]: Without dead ends: 10530 [2021-12-06 17:42:26,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 17:42:26,565 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 10 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:26,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 663 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10530 states. [2021-12-06 17:42:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10530 to 10482. [2021-12-06 17:42:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10482 states, 8961 states have (on average 1.1008815980359334) internal successors, (9865), 9058 states have internal predecessors, (9865), 792 states have call successors, (792), 608 states have call predecessors, (792), 728 states have return successors, (1049), 817 states have call predecessors, (1049), 792 states have call successors, (1049) [2021-12-06 17:42:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10482 states to 10482 states and 11706 transitions. [2021-12-06 17:42:27,106 INFO L78 Accepts]: Start accepts. Automaton has 10482 states and 11706 transitions. Word has length 163 [2021-12-06 17:42:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:27,106 INFO L470 AbstractCegarLoop]: Abstraction has 10482 states and 11706 transitions. [2021-12-06 17:42:27,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 17:42:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 10482 states and 11706 transitions. [2021-12-06 17:42:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-12-06 17:42:27,111 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:27,111 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-06 17:42:27,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-06 17:42:27,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 17:42:27,312 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:27,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:27,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1729265870, now seen corresponding path program 1 times [2021-12-06 17:42:27,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:27,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967137838] [2021-12-06 17:42:27,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:27,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-06 17:42:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-06 17:42:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 17:42:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-06 17:42:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-06 17:42:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,409 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2021-12-06 17:42:27,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:27,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967137838] [2021-12-06 17:42:27,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967137838] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:42:27,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622437674] [2021-12-06 17:42:27,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:27,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 17:42:27,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:42:27,410 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 17:42:27,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 17:42:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:27,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 17:42:27,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:42:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-06 17:42:27,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:42:27,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622437674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:27,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 17:42:27,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 17:42:27,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980122564] [2021-12-06 17:42:27,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:27,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:42:27,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:42:27,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:27,592 INFO L87 Difference]: Start difference. First operand 10482 states and 11706 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 17:42:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:27,900 INFO L93 Difference]: Finished difference Result 14200 states and 15867 transitions. [2021-12-06 17:42:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:42:27,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 200 [2021-12-06 17:42:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:27,906 INFO L225 Difference]: With dead ends: 14200 [2021-12-06 17:42:27,906 INFO L226 Difference]: Without dead ends: 3266 [2021-12-06 17:42:27,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 17:42:27,912 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 124 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:27,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 430 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:42:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2021-12-06 17:42:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3266. [2021-12-06 17:42:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3266 states, 2773 states have (on average 1.0952037504507752) internal successors, (3037), 2794 states have internal predecessors, (3037), 276 states have call successors, (276), 200 states have call predecessors, (276), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2021-12-06 17:42:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 3614 transitions. [2021-12-06 17:42:28,066 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 3614 transitions. Word has length 200 [2021-12-06 17:42:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:28,066 INFO L470 AbstractCegarLoop]: Abstraction has 3266 states and 3614 transitions. [2021-12-06 17:42:28,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 17:42:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 3614 transitions. [2021-12-06 17:42:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-06 17:42:28,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:42:28,068 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-12-06 17:42:28,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-06 17:42:28,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-06 17:42:28,269 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:42:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:42:28,270 INFO L85 PathProgramCache]: Analyzing trace with hash 208727340, now seen corresponding path program 1 times [2021-12-06 17:42:28,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:42:28,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688510179] [2021-12-06 17:42:28,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:42:28,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:42:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 17:42:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 17:42:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 17:42:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-06 17:42:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-06 17:42:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 17:42:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-06 17:42:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 17:42:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-06 17:42:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 17:42:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-06 17:42:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:42:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-12-06 17:42:28,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:42:28,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688510179] [2021-12-06 17:42:28,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688510179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:42:28,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:42:28,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:42:28,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583530442] [2021-12-06 17:42:28,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:42:28,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:42:28,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:42:28,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:42:28,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 17:42:28,389 INFO L87 Difference]: Start difference. First operand 3266 states and 3614 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 17:42:28,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:42:28,988 INFO L93 Difference]: Finished difference Result 3482 states and 3838 transitions. [2021-12-06 17:42:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 17:42:28,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 201 [2021-12-06 17:42:28,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:42:28,989 INFO L225 Difference]: With dead ends: 3482 [2021-12-06 17:42:28,989 INFO L226 Difference]: Without dead ends: 0 [2021-12-06 17:42:28,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-12-06 17:42:28,991 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 662 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:42:28,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [695 Valid, 849 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 17:42:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-06 17:42:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-06 17:42:28,992 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-12-06 17:42:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-06 17:42:28,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 201 [2021-12-06 17:42:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:42:28,992 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 17:42:28,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 5 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-06 17:42:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-06 17:42:28,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-06 17:42:28,994 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 17:42:28,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-06 17:42:28,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-06 17:44:10,379 WARN L227 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 966 DAG size of output: 161 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-06 17:44:15,679 WARN L227 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 769 DAG size of output: 139 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-06 17:44:24,140 WARN L227 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 969 DAG size of output: 164 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-06 17:44:29,511 WARN L227 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 766 DAG size of output: 136 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-06 17:44:31,125 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 210) no Hoare annotation was computed. [2021-12-06 17:44:31,125 INFO L854 garLoopResultBuilder]: At program point L197(lines 181 199) the Hoare annotation is: (let ((.cse51 (<= 2 ~E_2~0)) (.cse50 (<= 2 ~E_M~0)) (.cse49 (= ~t1_i~0 1)) (.cse7 (= 0 ~t2_st~0)) (.cse48 (= ~t1_pc~0 1)) (.cse52 (= ~m_i~0 1)) (.cse53 (= ~t2_i~0 1)) (.cse55 (+ ~local~0 1)) (.cse54 (= ~m_pc~0 0)) (.cse47 (<= 2 ~t1_st~0)) (.cse8 (= ~m_st~0 0)) (.cse40 (<= 2 ~t2_st~0)) (.cse6 (= ~t1_st~0 0)) (.cse2 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse3 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse31 (= |old(~t1_st~0)| ~t1_st~0)) (.cse4 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse34 (= |old(~t2_st~0)| ~t2_st~0)) (.cse9 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse10 (<= |activate_threads_is_transmit1_triggered_#res#1| 0)) (.cse11 (<= |activate_threads_~tmp~1#1| 0)) (.cse12 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse13 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse14 (<= 0 |activate_threads_is_transmit1_triggered_#res#1|)) (.cse15 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|))) (let ((.cse38 (and .cse2 .cse3 .cse31 .cse4 .cse5 .cse34 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (.cse32 (not (= |old(~m_st~0)| 0))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse45 (and .cse2 .cse3 .cse4 .cse5 .cse34 .cse6 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)) (.cse19 (not (<= ~t1_pc~0 0))) (.cse35 (not (<= 2 |old(~t2_st~0)|))) (.cse43 (and .cse47 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 .cse40 .cse13 .cse14 .cse15)) (.cse44 (and .cse2 .cse3 .cse31 .cse4 .cse5 .cse34 .cse9 .cse11 .cse13)) (.cse20 (not .cse54)) (.cse22 (not (<= ~t2_pc~0 0))) (.cse33 (not (= ~token~0 ~local~0))) (.cse41 (not (< .cse55 ~token~0))) (.cse42 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse1 (not .cse53)) (.cse30 (not (<= 2 |old(~t1_st~0)|))) (.cse25 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (<= 2 ~T1_E~0))) (.cse17 (not .cse52)) (.cse18 (not (= |old(~t2_st~0)| 0))) (.cse26 (not (= ~m_pc~0 1))) (.cse27 (not .cse48)) (.cse28 (and .cse2 .cse3 .cse31 .cse4 .cse5 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 .cse14 .cse15)) (.cse21 (not .cse49)) (.cse23 (not .cse50)) (.cse37 (not (<= .cse55 ~token~0))) (.cse36 (not (= ~t2_pc~0 1))) (.cse29 (not (<= 2 ~E_1~0))) (.cse39 (not (<= ~token~0 .cse55))) (.cse24 (not .cse51))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 (or (and .cse5 .cse6 .cse7) (and .cse8 .cse6 .cse7)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse1 .cse25 .cse16 .cse17 .cse18 .cse26 .cse27 .cse28 .cse21 .cse22 .cse23 .cse29) (or .cse1 .cse30 .cse16 .cse17 .cse18 .cse27 .cse20 .cse21 (and .cse31 .cse10 .cse12 .cse14 .cse15) .cse22 .cse23 .cse32 .cse29 .cse24 .cse33) (or .cse1 .cse30 .cse16 .cse17 (and .cse31 .cse34 .cse10 .cse12 .cse14 .cse15) .cse27 .cse35 .cse20 .cse21 .cse23 .cse32 .cse36 .cse29 .cse24 .cse33) (or .cse1 .cse25 .cse16 .cse17 .cse26 .cse27 .cse35 .cse21 .cse23 .cse37 .cse38 .cse36 .cse29 .cse39) (or .cse0 .cse1 .cse16 .cse17 .cse35 .cse19 .cse20 .cse21 .cse23 (and .cse2 .cse3 .cse4 .cse9 .cse10 .cse11 (or (and .cse8 .cse6) (and .cse5 .cse34 .cse6)) .cse12 .cse40 .cse13 .cse14 .cse15) .cse36 .cse24) (or .cse0 .cse1 .cse25 .cse16 .cse17 .cse18 .cse26 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse11 .cse12 .cse7 .cse13 .cse14 .cse15) .cse19 .cse21 .cse22 .cse23 .cse29 .cse24) (or .cse41 .cse1 .cse30 .cse16 .cse17 .cse26 .cse27 .cse35 .cse21 .cse23 .cse32 .cse38 .cse36 .cse29 .cse24 .cse42) (or .cse1 .cse30 .cse16 .cse17 .cse27 .cse35 .cse20 .cse43 .cse21 .cse23 .cse36 .cse24 .cse44 .cse33) (or .cse1 .cse30 .cse25 .cse16 .cse17 .cse26 .cse27 .cse35 .cse21 .cse23 .cse38 .cse36 .cse29 .cse24) (or .cse0 .cse1 .cse45 .cse25 .cse16 .cse17 .cse26 .cse27 .cse35 .cse21 .cse23 .cse36 .cse29 .cse24 .cse33) (or .cse0 .cse1 .cse16 .cse17 .cse35 .cse19 .cse20 .cse21 .cse34 .cse23 .cse32 .cse36 .cse29 .cse24 .cse33) (or .cse0 .cse1 .cse45 .cse25 .cse16 .cse17 .cse26 .cse35 .cse19 .cse21 .cse23 .cse36 .cse29 .cse24) (or .cse1 .cse30 .cse16 .cse17 .cse26 .cse27 .cse35 .cse43 .cse21 .cse23 .cse36 .cse24 .cse44 .cse33) (let ((.cse46 (or (and .cse48 .cse49 .cse31 .cse50 .cse5 .cse34 .cse51 .cse52 .cse53 .cse54 .cse7) (and .cse48 .cse49 .cse50 .cse8 .cse51 .cse52 .cse53 .cse54 .cse7)))) (or (and .cse2 .cse3 .cse31 .cse4 .cse5 .cse9 .cse11 .cse13 .cse46) .cse1 .cse30 .cse16 .cse17 .cse18 .cse27 .cse20 .cse21 .cse22 .cse23 (and .cse47 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse46 .cse15) .cse24 .cse33)) (or .cse41 .cse1 .cse30 .cse25 .cse16 .cse17 .cse26 .cse27 .cse21 (and .cse47 .cse8 .cse10 .cse12 .cse14 .cse15) .cse36 .cse29 (and .cse31 .cse4 .cse5 .cse34 .cse10 .cse11 .cse12 .cse14 .cse15) .cse24 .cse42) (or .cse1 .cse30 .cse25 .cse16 .cse17 .cse18 .cse26 .cse27 .cse28 .cse21 .cse23 .cse37 .cse36 .cse29 .cse39 .cse24)))) [2021-12-06 17:44:31,126 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 194) no Hoare annotation was computed. [2021-12-06 17:44:31,126 INFO L858 garLoopResultBuilder]: For program point L441(lines 441 445) no Hoare annotation was computed. [2021-12-06 17:44:31,126 INFO L858 garLoopResultBuilder]: For program point L185-2(lines 185 194) no Hoare annotation was computed. [2021-12-06 17:44:31,126 INFO L858 garLoopResultBuilder]: For program point L441-2(lines 416 449) no Hoare annotation was computed. [2021-12-06 17:44:31,126 INFO L854 garLoopResultBuilder]: At program point L177(lines 165 179) the Hoare annotation is: (let ((.cse26 (= |old(~t2_st~0)| ~t2_st~0)) (.cse33 (= ~t1_st~0 0)) (.cse24 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse34 (= 0 ~t2_st~0)) (.cse31 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse32 (+ ~local~0 1))) (let ((.cse11 (not (<= .cse32 ~token~0))) (.cse14 (not (<= ~token~0 .cse32))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse0 (and .cse24 .cse25 .cse30 .cse34 .cse31)) (.cse6 (not (= |old(~t2_st~0)| 0))) (.cse18 (not (<= ~t2_pc~0 0))) (.cse28 (and .cse25 .cse33 .cse30 .cse34 .cse31)) (.cse19 (not (= ~token~0 ~local~0))) (.cse20 (not (= |old(~t1_st~0)| 0))) (.cse21 (not (<= ~t1_pc~0 0))) (.cse29 (not (= ~m_pc~0 0))) (.cse22 (and .cse25 .cse26 .cse33 .cse30 .cse31)) (.cse23 (not (< .cse32 ~token~0))) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (not (<= 2 |old(~t1_st~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~m_i~0 1))) (.cse7 (not (= ~m_pc~0 1))) (.cse8 (not (= ~t1_pc~0 1))) (.cse16 (not (<= 2 |old(~t2_st~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= 2 ~E_M~0))) (.cse17 (and .cse24 .cse25 .cse26 .cse30 .cse31)) (.cse12 (not (= ~t2_pc~0 1))) (.cse13 (not (<= 2 ~E_1~0))) (.cse15 (not (<= 2 ~E_2~0))) (.cse27 (not (<= ~token~0 (+ 2 ~local~0))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse12 .cse13 .cse15) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse13) (or .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse12 .cse15 .cse19) (or .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse16 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14) (or .cse20 .cse1 .cse3 .cse4 .cse5 .cse7 .cse16 .cse21 .cse9 .cse10 .cse22 .cse12 .cse13 .cse15) (or .cse20 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse16 .cse9 .cse10 .cse22 .cse12 .cse13 .cse15 .cse19) (or .cse23 .cse1 (and .cse24 .cse25 .cse26) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse12 .cse13 .cse15 .cse27) (or .cse20 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse9 .cse18 .cse10 .cse28 .cse13 .cse15) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse29 .cse9 .cse18 .cse10 .cse15 .cse19) (or .cse20 .cse1 .cse4 .cse5 .cse6 .cse21 .cse29 .cse9 .cse18 .cse10 .cse28 .cse15) (or .cse1 .cse2 .cse4 .cse5 .cse8 .cse16 .cse29 .cse9 .cse10 .cse17 .cse12 .cse15 .cse19) (or .cse20 .cse1 .cse4 .cse5 .cse16 .cse21 .cse29 .cse9 .cse10 .cse22 .cse12 .cse15) (or .cse23 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse16 .cse9 .cse10 (not (= |old(~m_st~0)| 0)) .cse17 .cse12 .cse13 .cse15 .cse27)))) [2021-12-06 17:44:31,126 INFO L858 garLoopResultBuilder]: For program point L433(lines 433 437) no Hoare annotation was computed. [2021-12-06 17:44:31,126 INFO L858 garLoopResultBuilder]: For program point L433-2(lines 433 437) no Hoare annotation was computed. [2021-12-06 17:44:31,126 INFO L858 garLoopResultBuilder]: For program point L425(lines 425 429) no Hoare annotation was computed. [2021-12-06 17:44:31,126 INFO L858 garLoopResultBuilder]: For program point L425-2(lines 425 429) no Hoare annotation was computed. [2021-12-06 17:44:31,126 INFO L858 garLoopResultBuilder]: For program point L186(lines 186 191) no Hoare annotation was computed. [2021-12-06 17:44:31,127 INFO L854 garLoopResultBuilder]: At program point L215(lines 203 217) the Hoare annotation is: (let ((.cse36 (= ~t1_st~0 0)) (.cse32 (<= 2 ~t1_st~0)) (.cse33 (= ~m_st~0 0)) (.cse42 (<= 2 ~t2_st~0)) (.cse26 (<= |activate_threads_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse37 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse38 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse27 (<= |activate_threads_~tmp___0~0#1| 0)) (.cse5 (= |old(~t1_st~0)| ~t1_st~0)) (.cse28 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse6 (= ~m_st~0 |old(~m_st~0)|)) (.cse29 (< 0 (+ |activate_threads_~tmp___0~0#1| 1))) (.cse22 (= |old(~t2_st~0)| ~t2_st~0)) (.cse40 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse16 (<= |activate_threads_is_transmit1_triggered_#res#1| 0)) (.cse30 (<= |activate_threads_~tmp~1#1| 0)) (.cse17 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse41 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse31 (<= 0 |activate_threads_is_transmit2_triggered_~__retres1~2#1|)) (.cse18 (<= 0 |activate_threads_is_transmit1_triggered_#res#1|)) (.cse19 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse50 (+ ~local~0 1))) (let ((.cse25 (not (< .cse50 ~token~0))) (.cse34 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse44 (and .cse26 .cse37 .cse38 .cse27 .cse5 .cse28 .cse6 .cse29 .cse22 .cse40 .cse16 .cse30 .cse17 .cse41 .cse31 .cse18 .cse19)) (.cse46 (and .cse32 .cse26 .cse37 (or (and .cse5 .cse6 .cse22) .cse33) .cse38 .cse27 .cse28 .cse29 .cse40 .cse30 .cse42 .cse41 .cse31)) (.cse47 (and .cse26 .cse37 .cse38 .cse28 .cse36 .cse40 .cse30 .cse42 .cse41 .cse31)) (.cse45 (<= 2 ~m_st~0)) (.cse43 (not (<= ~t1_pc~0 0))) (.cse15 (not (= ~m_pc~0 0))) (.cse11 (not (<= ~t2_pc~0 0))) (.cse20 (not (= |old(~m_st~0)| 0))) (.cse39 (= 0 ~t2_st~0)) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (= |old(~t2_st~0)| 0))) (.cse48 (not (<= .cse50 ~token~0))) (.cse49 (not (<= ~token~0 .cse50))) (.cse35 (not (= |old(~t1_st~0)| 0))) (.cse0 (not (= ~t2_i~0 1))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (not (= ~m_i~0 1))) (.cse8 (not (= ~m_pc~0 1))) (.cse9 (not (= ~t1_pc~0 1))) (.cse23 (not (<= 2 |old(~t2_st~0)|))) (.cse10 (not (= ~t1_i~0 1))) (.cse12 (not (<= 2 ~E_M~0))) (.cse24 (not (= ~t2_pc~0 1))) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (<= 2 ~E_2~0))) (.cse21 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse3 .cse4 .cse7 .cse9 .cse15 .cse10 (and .cse5 .cse16 .cse17 .cse18 .cse19) .cse11 .cse12 .cse20 .cse13 .cse14 .cse21) (or .cse0 .cse1 .cse3 .cse4 (and .cse5 .cse22 .cse16 .cse17 .cse18 .cse19) .cse9 .cse23 .cse15 .cse10 .cse12 .cse20 .cse24 .cse13 .cse14 .cse21) (or .cse25 .cse0 (and .cse26 .cse27 .cse5 .cse28 .cse6 .cse29 .cse22 .cse16 .cse30 .cse17 .cse31 .cse18 .cse19) .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 (and .cse32 .cse26 .cse27 .cse33 .cse29 .cse16 .cse17 .cse31 .cse18 .cse19) .cse24 .cse13 .cse14 .cse34) (or .cse35 (and .cse6 .cse36) .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21) (or .cse0 .cse1 .cse3 .cse4 .cse7 (and .cse32 .cse26 .cse37 .cse38 .cse27 .cse28 (or (and .cse33 .cse39) (and .cse5 .cse6 .cse39)) .cse29 .cse40 .cse30 .cse41 .cse31) .cse9 .cse15 .cse10 .cse11 .cse12 (and .cse26 .cse37 .cse38 .cse28 .cse36 .cse40 .cse30 .cse39 .cse41 .cse31) .cse14 .cse21) (or (and .cse26 .cse37 .cse38 .cse27 .cse28 .cse29 .cse36 .cse40 .cse16 .cse30 .cse17 .cse42 .cse41 .cse31 .cse18 .cse19) .cse35 .cse0 .cse3 .cse4 .cse23 .cse43 .cse15 .cse10 .cse12 .cse24 .cse14) (or .cse25 .cse0 .cse44 .cse1 .cse3 .cse4 .cse8 .cse9 .cse23 .cse10 .cse12 .cse20 .cse24 .cse13 .cse14 .cse34) (or .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 (and .cse26 .cse37 .cse38 .cse27 .cse28 .cse45 .cse29 .cse40 .cse16 .cse30 .cse17 .cse39 .cse41 .cse31 .cse18 .cse19) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse35 .cse0 .cse2 .cse3 .cse4 (and .cse26 .cse37 .cse38 .cse27 .cse28 .cse45 .cse29 .cse36 .cse40 .cse16 .cse30 .cse17 .cse42 .cse41 .cse31 .cse18 .cse19) .cse8 .cse23 .cse43 .cse10 .cse12 .cse24 .cse13 .cse14) (or .cse35 .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse43 .cse10 .cse11 .cse12 (and .cse26 .cse37 .cse38 .cse27 .cse28 .cse45 .cse29 .cse36 .cse40 .cse16 .cse30 .cse17 .cse39 .cse41 .cse31 .cse18 .cse19) .cse13 .cse14) (or .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse23 .cse10 .cse46 .cse12 .cse24 .cse47 .cse14 .cse21) (or .cse0 .cse44 .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 .cse23 .cse10 .cse12 .cse24 .cse13 .cse14) (or .cse0 .cse1 .cse3 .cse4 .cse9 .cse23 .cse15 .cse10 .cse46 .cse12 .cse24 .cse47 .cse14 .cse21) (or .cse35 .cse0 .cse3 .cse4 .cse7 .cse43 .cse15 .cse10 .cse11 .cse12 (and .cse26 .cse37 .cse38 .cse27 .cse28 .cse29 .cse36 .cse40 .cse16 .cse30 .cse17 .cse39 .cse41 .cse31 .cse18 .cse19) .cse14) (or .cse35 .cse0 (and .cse6 .cse22) .cse3 .cse4 .cse23 .cse43 .cse15 .cse10 .cse12 .cse20 .cse24 .cse13 .cse14 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse8 .cse9 .cse23 .cse10 (and .cse26 .cse37 .cse38 .cse27 .cse28 .cse45 .cse29 .cse40 .cse16 .cse30 .cse17 .cse42 .cse41 .cse31 .cse18 .cse19) .cse12 .cse48 (and .cse37 .cse38 .cse27 .cse5 .cse28 .cse6 .cse29 .cse22 .cse40 .cse16 .cse30 .cse17 .cse41 .cse18 .cse19) .cse24 .cse13 .cse49) (or .cse35 .cse0 .cse3 .cse4 .cse7 .cse6 .cse43 .cse15 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 .cse21) (or (and .cse26 .cse37 .cse38 .cse27 .cse5 .cse28 .cse6 .cse29 .cse40 .cse16 .cse30 .cse17 .cse39 .cse41 .cse31 .cse18 .cse19) .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse12 .cse48 .cse24 .cse13 .cse49 .cse14) (or .cse35 .cse0 .cse2 .cse3 .cse4 .cse8 .cse9 .cse23 .cse10 (and .cse26 .cse37 .cse38 .cse27 .cse28 .cse6 .cse29 .cse22 .cse36 .cse40 .cse16 .cse30 .cse17 .cse41 .cse31 .cse18 .cse19) .cse12 .cse24 .cse13 .cse14 .cse21)))) [2021-12-06 17:44:31,127 INFO L854 garLoopResultBuilder]: At program point L178(lines 162 180) the Hoare annotation is: (let ((.cse27 (= |old(~t2_st~0)| ~t2_st~0)) (.cse32 (= ~t1_st~0 0)) (.cse30 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse31 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (= ~m_st~0 |old(~m_st~0)|)) (.cse33 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse34 (= 0 ~t2_st~0)) (.cse35 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse36 (+ ~local~0 1))) (let ((.cse21 (not (<= .cse36 ~token~0))) (.cse22 (not (<= ~token~0 .cse36))) (.cse5 (and .cse30 .cse31 .cse25 .cse26 .cse33 .cse34 .cse35)) (.cse17 (and .cse30 .cse31 .cse26 .cse27 .cse32 .cse33 .cse35)) (.cse20 (not (= ~token~0 ~local~0))) (.cse24 (not (< .cse36 ~token~0))) (.cse12 (not (<= 2 |old(~t1_st~0)|))) (.cse7 (not (= ~t1_pc~0 1))) (.cse13 (not (<= 2 |old(~t2_st~0)|))) (.cse14 (and .cse30 .cse31 .cse25 .cse26 .cse27 .cse33 .cse35)) (.cse15 (not (= ~t2_pc~0 1))) (.cse28 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse1 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (= ~m_pc~0 1))) (.cse11 (not (<= 2 ~E_1~0))) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse0 (not (= ~t2_i~0 1))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (not (= ~m_i~0 1))) (.cse4 (not (= |old(~t2_st~0)| 0))) (.cse19 (not (<= ~t1_pc~0 0))) (.cse23 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= ~t2_pc~0 0))) (.cse10 (not (<= 2 ~E_M~0))) (.cse29 (and .cse30 .cse31 .cse26 .cse32 .cse33 .cse34 .cse35)) (.cse16 (not (<= 2 ~E_2~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse2 .cse3 .cse6 .cse7 .cse13 .cse8 .cse10 .cse14 .cse15 .cse11 .cse16) (or .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse6 .cse13 .cse19 .cse8 .cse10 .cse15 .cse11 .cse16) (or .cse17 .cse18 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse13 .cse8 .cse10 .cse15 .cse11 .cse16 .cse20) (or .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse21 .cse15 .cse11 .cse22 .cse16) (or .cse0 .cse12 .cse2 .cse3 .cse6 .cse7 .cse13 .cse8 .cse10 .cse14 .cse15 .cse16 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse13 .cse8 .cse10 .cse21 .cse14 .cse15 .cse11 .cse22) (or .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse7 .cse23 .cse8 .cse9 .cse10 .cse16 .cse20) (or .cse24 .cse0 (and .cse25 .cse26 .cse27) .cse12 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse15 .cse11 .cse16 .cse28) (or .cse17 .cse18 .cse0 .cse2 .cse3 .cse13 .cse19 .cse23 .cse8 .cse10 .cse15 .cse16) (or .cse0 .cse12 .cse2 .cse3 .cse7 .cse13 .cse23 .cse8 .cse10 .cse14 .cse15 .cse16 .cse20) (or .cse24 .cse0 .cse12 .cse2 .cse3 .cse6 .cse7 .cse13 .cse8 .cse10 .cse14 (not (= |old(~m_st~0)| 0)) .cse15 .cse11 .cse16 .cse28) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse19 .cse8 .cse9 .cse10 .cse29 .cse11 .cse16) (or .cse18 .cse0 .cse2 .cse3 .cse4 .cse19 .cse23 .cse8 .cse9 .cse10 .cse29 .cse16)))) [2021-12-06 17:44:31,127 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 175) no Hoare annotation was computed. [2021-12-06 17:44:31,127 INFO L858 garLoopResultBuilder]: For program point L166-2(lines 166 175) no Hoare annotation was computed. [2021-12-06 17:44:31,128 INFO L854 garLoopResultBuilder]: At program point L216(lines 200 218) the Hoare annotation is: (let ((.cse52 (+ ~local~0 1)) (.cse33 (<= |activate_threads_is_transmit1_triggered_#res#1| 0)) (.cse35 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse40 (<= 0 |activate_threads_is_transmit1_triggered_#res#1|)) (.cse41 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse47 (<= 2 ~t1_st~0)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse43 (= |old(~t2_st~0)| ~t2_st~0)) (.cse48 (= ~m_st~0 0)) (.cse27 (<= |activate_threads_~tmp___0~0#1| 0)) (.cse30 (< 0 (+ |activate_threads_~tmp___0~0#1| 1))) (.cse23 (<= |activate_threads_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse24 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse25 (<= 0 |activate_threads_is_transmit2_triggered_#res#1|)) (.cse26 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse28 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse31 (= ~t1_st~0 0)) (.cse32 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse34 (<= |activate_threads_~tmp~1#1| 0)) (.cse36 (<= 2 ~t2_st~0)) (.cse37 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse38 (<= |activate_threads_is_transmit2_triggered_#res#1| 0)) (.cse39 (<= 0 |activate_threads_is_transmit2_triggered_~__retres1~2#1|))) (let ((.cse9 (and .cse23 .cse24 .cse25 .cse26 .cse28 .cse31 .cse32 .cse34 .cse36 .cse37 .cse38 .cse39)) (.cse11 (and .cse47 .cse23 .cse24 .cse25 (or (and .cse15 .cse16 .cse43) .cse48) .cse26 .cse27 .cse28 .cse30 .cse32 .cse34 .cse36 .cse37 .cse38 .cse39)) (.cse49 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse15 .cse28 .cse16 .cse30 .cse43 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse41)) (.cse50 (not (< .cse52 ~token~0))) (.cse51 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse1 (not (<= 2 |old(~t1_st~0)|))) (.cse45 (not (<= .cse52 ~token~0))) (.cse46 (not (<= ~token~0 .cse52))) (.cse6 (not (= ~m_pc~0 0))) (.cse42 (not (= |old(~m_st~0)| 0))) (.cse17 (not (= |old(~t2_st~0)| 0))) (.cse22 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= ~t2_pc~0 0))) (.cse29 (<= 2 ~m_st~0)) (.cse44 (= 0 ~t2_st~0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse0 (not (= ~t2_i~0 1))) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (not (= ~m_i~0 1))) (.cse18 (not (= ~m_pc~0 1))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (<= 2 |old(~t2_st~0)|))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~t2_pc~0 1))) (.cse20 (not (<= 2 ~E_1~0))) (.cse12 (not (<= 2 ~E_2~0))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse14 .cse2 .cse3 (and .cse15 .cse16) .cse17 .cse18 .cse4 .cse7 .cse19 .cse8 .cse20 .cse12) (or .cse21 .cse0 .cse14 .cse2 .cse3 .cse18 .cse5 .cse22 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) .cse7 .cse8 .cse10 .cse20 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 (and .cse15 .cse33 .cse35 .cse40 .cse41) .cse19 .cse8 .cse42 .cse20 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 (and .cse15 .cse43 .cse33 .cse35 .cse40 .cse41) .cse4 .cse5 .cse6 .cse7 .cse8 .cse42 .cse10 .cse20 .cse12 .cse13) (or .cse21 (and .cse16 .cse31) .cse0 .cse14 .cse2 .cse3 .cse17 .cse18 .cse4 .cse7 .cse19 .cse8 .cse20 .cse12 .cse13) (or .cse21 .cse0 .cse2 .cse3 .cse17 .cse22 .cse6 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse44 .cse37 .cse38 .cse39 .cse40 .cse41) .cse7 .cse19 .cse8 .cse12) (or .cse0 .cse14 .cse2 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse45 (and .cse24 .cse26 .cse27 .cse15 .cse28 .cse16 .cse30 .cse43 .cse32 .cse33 .cse34 .cse35 .cse37 .cse40 .cse41) (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) .cse10 .cse20 .cse46) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 .cse19 .cse8 (and .cse23 .cse24 .cse25 .cse26 .cse28 .cse31 .cse32 .cse34 .cse44 .cse37 .cse38 .cse39) (and .cse47 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (or (and .cse48 .cse44) (and .cse15 .cse16 .cse44)) .cse30 .cse32 .cse34 .cse37 .cse38 .cse39) .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse3 .cse17 .cse18 .cse4 .cse7 .cse19 .cse8 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse34 .cse35 .cse44 .cse37 .cse38 .cse39 .cse40 .cse41) .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse21 .cse0 (and .cse16 .cse43) .cse2 .cse3 .cse5 .cse22 .cse6 .cse7 .cse8 .cse42 .cse10 .cse20 .cse12 .cse13) (or .cse49 .cse0 .cse1 .cse14 .cse2 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse10 .cse20 .cse12) (or .cse50 .cse0 (and .cse47 .cse23 .cse25 .cse27 .cse48 .cse30 .cse33 .cse35 .cse38 .cse39 .cse40 .cse41) .cse1 .cse14 .cse2 .cse3 .cse18 .cse4 .cse7 (and .cse23 .cse25 .cse27 .cse15 .cse28 .cse16 .cse30 .cse43 .cse33 .cse34 .cse35 .cse38 .cse39 .cse40 .cse41) .cse10 .cse20 .cse12 .cse51) (or .cse21 .cse0 .cse2 .cse3 .cse5 .cse22 .cse6 .cse7 .cse8 .cse10 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) .cse12) (or .cse49 .cse50 .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse42 .cse10 .cse20 .cse12 .cse51) (or (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse15 .cse28 .cse16 .cse30 .cse32 .cse33 .cse34 .cse35 .cse44 .cse37 .cse38 .cse39 .cse40 .cse41) .cse0 .cse1 .cse14 .cse2 .cse3 .cse17 .cse18 .cse4 .cse7 .cse8 .cse45 .cse10 .cse20 .cse46 .cse12) (or .cse21 .cse0 .cse2 .cse3 .cse17 .cse16 .cse22 .cse6 .cse7 .cse19 .cse8 .cse42 .cse20 .cse12 .cse13) (or .cse21 .cse0 .cse14 .cse2 .cse3 .cse17 .cse18 .cse22 .cse7 .cse19 .cse8 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse44 .cse37 .cse38 .cse39 .cse40 .cse41) .cse20 .cse12) (or .cse21 .cse0 .cse14 .cse2 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse16 .cse30 .cse43 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse41) .cse10 .cse20 .cse12 .cse13)))) [2021-12-06 17:44:31,128 INFO L854 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 416 449) the Hoare annotation is: (let ((.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse30 (+ ~local~0 1)) (.cse31 (= 0 ~t2_st~0)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse29 (= |old(~t2_st~0)| ~t2_st~0)) (.cse32 (= ~t1_st~0 0))) (let ((.cse7 (and .cse28 .cse29 .cse32)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse24 (and .cse28 .cse32 .cse31)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse21 (not (<= ~t2_pc~0 0))) (.cse25 (not (< .cse30 ~token~0))) (.cse26 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse20 (not (= |old(~t2_st~0)| 0))) (.cse14 (not (= ~m_pc~0 1))) (.cse16 (not (<= .cse30 ~token~0))) (.cse22 (and .cse27 .cse28 .cse31)) (.cse17 (not (<= 2 ~E_1~0))) (.cse18 (not (<= ~token~0 .cse30))) (.cse1 (not (= ~t2_i~0 1))) (.cse12 (and .cse27 .cse28 .cse29)) (.cse19 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (not (= ~m_i~0 1))) (.cse15 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 |old(~t2_st~0)|))) (.cse6 (not (= ~m_pc~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~t2_pc~0 1))) (.cse11 (not (<= 2 ~E_2~0))) (.cse23 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse12 .cse13 .cse2 .cse3 .cse14 .cse15 .cse4 .cse8 .cse9 .cse16 .cse10 .cse17 .cse18) (or .cse1 .cse19 .cse2 .cse3 .cse20 .cse15 .cse6 .cse8 .cse21 .cse9 .cse22 .cse11 .cse23) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse14 .cse15 .cse4 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse23) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse20 .cse24 .cse14 .cse5 .cse8 .cse21 .cse9 .cse17 .cse11) (or .cse1 .cse12 .cse19 .cse13 .cse2 .cse3 .cse14 .cse15 .cse4 .cse8 .cse9 .cse10 .cse17 .cse11) (or .cse1 .cse12 .cse19 .cse2 .cse3 .cse14 .cse15 .cse4 .cse8 .cse9 .cse10 .cse11 .cse23) (or .cse25 .cse1 .cse12 .cse19 .cse13 .cse2 .cse3 .cse14 .cse15 .cse8 .cse10 .cse17 .cse11 .cse26) (or .cse1 .cse13 .cse2 .cse3 .cse20 .cse14 .cse15 .cse8 .cse21 .cse9 .cse22 .cse17) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse24 .cse5 .cse6 .cse8 .cse21 .cse9 .cse11) (or .cse25 .cse1 .cse12 .cse19 .cse2 .cse3 .cse14 .cse15 .cse4 .cse8 .cse9 (not (= |old(~m_st~0)| 0)) .cse10 .cse17 .cse11 .cse26) (or .cse1 .cse19 .cse13 .cse2 .cse3 .cse20 .cse14 .cse15 .cse8 .cse9 .cse16 .cse22 .cse10 .cse17 .cse18 .cse11) (or .cse1 .cse12 .cse19 .cse2 .cse3 .cse15 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse23)))) [2021-12-06 17:44:31,128 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 213) no Hoare annotation was computed. [2021-12-06 17:44:31,128 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 416 449) no Hoare annotation was computed. [2021-12-06 17:44:31,128 INFO L858 garLoopResultBuilder]: For program point L204-2(lines 204 213) no Hoare annotation was computed. [2021-12-06 17:44:31,128 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2021-12-06 17:44:31,128 INFO L854 garLoopResultBuilder]: At program point L196(lines 184 198) the Hoare annotation is: (let ((.cse49 (<= 2 ~E_2~0)) (.cse48 (<= 2 ~E_M~0)) (.cse47 (= ~t1_i~0 1)) (.cse52 (= ~m_pc~0 0)) (.cse46 (= ~t1_pc~0 1)) (.cse50 (= ~m_i~0 1)) (.cse51 (= ~t2_i~0 1)) (.cse43 (<= 2 ~t1_st~0)) (.cse42 (= ~m_st~0 0)) (.cse44 (<= 2 ~t2_st~0)) (.cse37 (= ~t1_st~0 0)) (.cse53 (+ ~local~0 1)) (.cse26 (= |old(~t2_st~0)| ~t2_st~0)) (.cse33 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse34 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse25 (= |old(~t1_st~0)| ~t1_st~0)) (.cse35 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse36 (= ~m_st~0 |old(~m_st~0)|)) (.cse38 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse39 (<= |activate_threads_~tmp~1#1| 0)) (.cse27 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse40 (= 0 ~t2_st~0)) (.cse41 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse28 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|))) (let ((.cse5 (and .cse33 .cse34 .cse25 .cse35 .cse36 .cse38 .cse39 .cse27 .cse40 .cse41 .cse28)) (.cse16 (not (= |old(~m_st~0)| 0))) (.cse13 (and .cse33 .cse34 .cse25 .cse35 .cse36 .cse26 .cse38 .cse39 .cse27 .cse41 .cse28)) (.cse30 (not (<= .cse53 ~token~0))) (.cse31 (not (<= ~token~0 .cse53))) (.cse24 (and .cse33 .cse34 .cse35 .cse36 .cse26 .cse37 .cse38 .cse39 .cse27 .cse41 .cse28)) (.cse12 (not (< .cse53 ~token~0))) (.cse1 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (= ~m_pc~0 1))) (.cse11 (not (<= 2 ~E_1~0))) (.cse19 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse32 (not (<= ~t1_pc~0 0))) (.cse15 (not (<= 2 |old(~t2_st~0)|))) (.cse17 (not (= ~t2_pc~0 1))) (.cse20 (and .cse43 .cse33 .cse34 .cse35 .cse42 .cse38 .cse39 .cse27 .cse44 .cse41 .cse28)) (.cse21 (and .cse33 .cse34 .cse25 .cse35 .cse36 .cse26 .cse38 .cse39 .cse41)) (.cse0 (not .cse51)) (.cse14 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (not .cse50)) (.cse4 (not (= |old(~t2_st~0)| 0))) (.cse7 (not .cse46)) (.cse29 (not .cse52)) (.cse8 (not .cse47)) (.cse9 (not (<= ~t2_pc~0 0))) (.cse10 (not .cse48)) (.cse18 (not .cse49)) (.cse22 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse13 .cse14 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse10 .cse16 .cse17 .cse11 .cse18 .cse19) (or .cse0 .cse14 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse10 .cse17 .cse20 .cse18 .cse21 .cse22) (or .cse23 .cse0 .cse1 .cse2 .cse24 .cse3 .cse6 .cse7 .cse15 .cse8 .cse10 .cse17 .cse11 .cse18 .cse22) (or .cse0 .cse14 .cse2 .cse3 (and .cse25 .cse26 .cse27 .cse28) .cse7 .cse15 .cse29 .cse8 .cse10 .cse16 .cse17 .cse11 .cse18 .cse22) (or .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse30 .cse17 .cse11 .cse31 .cse18) (or .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse32 .cse8 .cse9 .cse10 (and .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse27 .cse40 .cse41 .cse28) .cse11 .cse18) (or .cse23 .cse0 .cse2 .cse3 .cse15 .cse32 .cse29 .cse8 .cse26 .cse10 .cse16 .cse17 .cse11 .cse18 .cse22) (or .cse0 .cse13 .cse14 .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse10 .cse17 .cse11 .cse18) (or .cse23 .cse0 .cse2 .cse3 .cse4 .cse32 .cse29 .cse8 .cse9 .cse10 (and .cse33 .cse34 .cse35 (or (and .cse36 .cse37 .cse40) (and .cse42 .cse37 .cse40)) .cse38 .cse39 .cse27 .cse41 .cse28) .cse18) (or .cse0 (and .cse25 .cse27 .cse28) .cse14 .cse2 .cse3 .cse4 .cse7 .cse29 .cse8 .cse9 .cse10 .cse16 .cse11 .cse18 .cse22) (or .cse0 .cse13 .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse8 .cse10 .cse30 .cse17 .cse11 .cse31) (or .cse23 .cse0 .cse1 .cse2 .cse24 .cse3 .cse6 .cse15 .cse32 .cse8 .cse10 .cse17 .cse11 .cse18) (or (and .cse43 .cse42 .cse27 .cse28) .cse12 .cse0 (and .cse25 .cse35 .cse36 .cse26 .cse39 .cse27 .cse28) .cse14 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse17 .cse11 .cse18 .cse19) (or .cse23 .cse0 .cse2 .cse3 .cse15 .cse32 .cse29 .cse8 .cse10 .cse17 .cse18 (and .cse33 .cse34 .cse35 .cse38 .cse39 (or (and .cse42 .cse37) (and .cse36 .cse26 .cse37)) .cse27 .cse44 .cse41 .cse28)) (or .cse0 .cse14 .cse2 .cse3 .cse7 .cse15 .cse29 .cse8 .cse10 .cse17 .cse20 .cse18 .cse21 .cse22) (let ((.cse45 (or (and .cse46 .cse47 .cse25 .cse48 .cse36 .cse26 .cse49 .cse50 .cse51 .cse52 .cse40) (and .cse46 .cse47 .cse48 .cse42 .cse49 .cse50 .cse51 .cse52 .cse40)))) (or (and .cse33 .cse34 .cse25 .cse35 .cse36 .cse38 .cse39 .cse41 .cse45) .cse0 (and .cse43 .cse33 .cse34 .cse35 .cse38 .cse39 .cse27 .cse41 .cse45 .cse28) .cse14 .cse2 .cse3 .cse4 .cse7 .cse29 .cse8 .cse9 .cse10 .cse18 .cse22))))) [2021-12-06 17:44:31,129 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 450 460) no Hoare annotation was computed. [2021-12-06 17:44:31,129 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 450 460) the Hoare annotation is: (let ((.cse8 (= |old(~t2_st~0)| ~t2_st~0)) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (= 0 ~t2_st~0))) (let ((.cse18 (+ ~local~0 1)) (.cse15 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (= ~m_pc~0 1))) (.cse23 (and .cse26 .cse7 .cse25)) (.cse19 (not (<= 2 ~E_1~0))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse21 (not (= |old(~t2_st~0)| 0))) (.cse9 (= ~t1_st~0 0)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse22 (not (<= ~t2_pc~0 0))) (.cse1 (not (= ~t2_i~0 1))) (.cse14 (and .cse26 .cse7 .cse8)) (.cse20 (not (<= 2 |old(~t1_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (not (= ~m_i~0 1))) (.cse17 (not (= ~t1_pc~0 1))) (.cse4 (not (<= 2 |old(~t2_st~0)|))) (.cse6 (not (= ~m_pc~0 0))) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (<= 2 ~E_M~0))) (.cse12 (not (= ~t2_pc~0 1))) (.cse13 (not (<= 2 ~E_2~0))) (.cse24 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse14 .cse15 .cse2 .cse3 .cse16 .cse17 .cse4 .cse10 .cse11 (not (<= .cse18 ~token~0)) .cse12 .cse19 (not (<= ~token~0 .cse18))) (or .cse1 .cse20 .cse2 .cse3 .cse21 .cse17 .cse6 .cse10 .cse22 .cse11 .cse23 .cse13 .cse24) (or .cse1 .cse14 .cse20 .cse2 .cse3 .cse16 .cse17 .cse4 .cse10 .cse11 .cse12 .cse13 .cse24) (or (not (< .cse18 ~token~0)) .cse1 .cse14 .cse20 .cse15 .cse2 .cse3 .cse16 .cse17 .cse10 .cse12 .cse19 .cse13 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse1 .cse15 .cse2 .cse3 .cse21 .cse16 .cse17 .cse10 .cse22 .cse11 .cse23 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse21 (and .cse7 .cse9 .cse25) .cse5 .cse6 .cse10 .cse22 .cse11 .cse13) (or .cse1 .cse14 .cse20 .cse2 .cse3 .cse17 .cse4 .cse6 .cse10 .cse11 .cse12 .cse13 .cse24)))) [2021-12-06 17:44:31,129 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 450 460) no Hoare annotation was computed. [2021-12-06 17:44:31,129 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 269) no Hoare annotation was computed. [2021-12-06 17:44:31,129 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 250 274) no Hoare annotation was computed. [2021-12-06 17:44:31,129 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 250 274) the Hoare annotation is: true [2021-12-06 17:44:31,129 INFO L861 garLoopResultBuilder]: At program point L271(lines 253 273) the Hoare annotation is: true [2021-12-06 17:44:31,129 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 267) no Hoare annotation was computed. [2021-12-06 17:44:31,129 INFO L858 garLoopResultBuilder]: For program point L258(lines 258 268) no Hoare annotation was computed. [2021-12-06 17:44:31,129 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 250 274) no Hoare annotation was computed. [2021-12-06 17:44:31,129 INFO L854 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 340 377) the Hoare annotation is: (let ((.cse1 (+ ~local~0 1)) (.cse3 (not (<= 2 ~t2_st~0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse13 (not (= ~t2_pc~0 1))) (.cse15 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (<= 2 |old(~E_2~0)|))) (.cse2 (not (= ~t2_i~0 1))) (.cse5 (not (= ~m_i~0 1))) (.cse20 (not (<= ~t1_pc~0 0))) (.cse21 (not (= ~m_pc~0 0))) (.cse8 (not (<= 2 |old(~T1_E~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse19 (not (<= ~t2_pc~0 0))) (.cse11 (not (<= 2 |old(~E_M~0)|))) (.cse16 (not (= 0 ~t2_st~0))) (.cse12 (not (= ~m_st~0 0))) (.cse17 (not (= ~t1_st~0 0))) (.cse14 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 (not (< .cse1 ~token~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse15 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (<= .cse1 ~token~0)) .cse16 .cse13 (not (<= ~token~0 .cse1)) .cse14) (or .cse15 .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse13 .cse14 .cse18) (or .cse15 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse16 .cse14) (or .cse15 .cse0 .cse2 .cse5 .cse6 .cse20 .cse8 .cse9 .cse10 .cse19 .cse11 .cse16 .cse17 .cse14) (or .cse15 .cse0 .cse2 .cse3 .cse5 .cse6 .cse20 .cse8 .cse9 .cse10 .cse11 .cse17 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18) (or .cse0 .cse2 .cse3 .cse5 .cse20 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13 .cse14 .cse18) (or .cse0 .cse2 .cse4 .cse5 .cse7 .cse21 .cse8 .cse9 .cse10 .cse19 .cse11 .cse16 .cse12 .cse14 .cse18) (or .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14) (or .cse15 .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse16 .cse17 .cse14 .cse18) (or .cse0 .cse2 .cse5 .cse20 .cse21 .cse8 .cse9 .cse10 .cse19 .cse11 .cse16 .cse12 .cse17 .cse14 .cse18))) [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point L349-1(lines 343 376) no Hoare annotation was computed. [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point L364-1(lines 343 376) no Hoare annotation was computed. [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point L354-1(lines 343 376) no Hoare annotation was computed. [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 343 376) no Hoare annotation was computed. [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 340 377) no Hoare annotation was computed. [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point L369-1(lines 340 377) no Hoare annotation was computed. [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point L359-1(lines 343 376) no Hoare annotation was computed. [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 219 226) no Hoare annotation was computed. [2021-12-06 17:44:31,130 INFO L861 garLoopResultBuilder]: At program point update_channelsFINAL(lines 219 226) the Hoare annotation is: true [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point L382-1(lines 381 414) no Hoare annotation was computed. [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point L407-1(lines 378 415) no Hoare annotation was computed. [2021-12-06 17:44:31,130 INFO L854 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 378 415) the Hoare annotation is: (let ((.cse1 (+ ~local~0 1)) (.cse3 (not (<= 2 ~t2_st~0))) (.cse4 (not (<= 2 ~t1_st~0))) (.cse13 (not (= ~t2_pc~0 1))) (.cse15 (not (<= 2 ~m_st~0))) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (not (= ~t1_pc~0 1))) (.cse0 (not (<= 2 |old(~E_2~0)|))) (.cse2 (not (= ~t2_i~0 1))) (.cse5 (not (= ~m_i~0 1))) (.cse20 (not (<= ~t1_pc~0 0))) (.cse21 (not (= ~m_pc~0 0))) (.cse8 (not (<= 2 |old(~T1_E~0)|))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse19 (not (<= ~t2_pc~0 0))) (.cse11 (not (<= 2 |old(~E_M~0)|))) (.cse16 (not (= 0 ~t2_st~0))) (.cse12 (not (= ~m_st~0 0))) (.cse17 (not (= ~t1_st~0 0))) (.cse14 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= |old(~T2_E~0)| ~T2_E~0) (= ~E_1~0 |old(~E_1~0)|) (= ~E_2~0 |old(~E_2~0)|))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 (not (< .cse1 ~token~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse15 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (<= .cse1 ~token~0)) .cse16 .cse13 (not (<= ~token~0 .cse1)) .cse14) (or .cse15 .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse13 .cse14 .cse18) (or .cse15 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse16 .cse14) (or .cse15 .cse0 .cse2 .cse5 .cse6 .cse20 .cse8 .cse9 .cse10 .cse19 .cse11 .cse16 .cse17 .cse14) (or .cse15 .cse0 .cse2 .cse3 .cse5 .cse6 .cse20 .cse8 .cse9 .cse10 .cse11 .cse17 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18) (or .cse0 .cse2 .cse3 .cse5 .cse20 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13 .cse14 .cse18) (or .cse0 .cse2 .cse4 .cse5 .cse7 .cse21 .cse8 .cse9 .cse10 .cse19 .cse11 .cse16 .cse12 .cse14 .cse18) (or .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14) (or .cse15 .cse0 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse16 .cse17 .cse14 .cse18) (or .cse0 .cse2 .cse5 .cse20 .cse21 .cse8 .cse9 .cse10 .cse19 .cse11 .cse16 .cse12 .cse17 .cse14 .cse18))) [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point L397-1(lines 381 414) no Hoare annotation was computed. [2021-12-06 17:44:31,130 INFO L858 garLoopResultBuilder]: For program point L387-1(lines 381 414) no Hoare annotation was computed. [2021-12-06 17:44:31,131 INFO L858 garLoopResultBuilder]: For program point L402-1(lines 381 414) no Hoare annotation was computed. [2021-12-06 17:44:31,131 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 378 415) no Hoare annotation was computed. [2021-12-06 17:44:31,131 INFO L858 garLoopResultBuilder]: For program point L392-1(lines 381 414) no Hoare annotation was computed. [2021-12-06 17:44:31,131 INFO L854 garLoopResultBuilder]: At program point L151(line 151) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (<= 2 ~E_1~0) (= ~t1_i~0 1) (<= ~token~0 (+ 2 ~local~0)) (<= 2 ~m_st~0) (<= 2 ~T1_E~0) (<= 2 ~E_2~0) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~t2_i~0 1) (< (+ ~local~0 1) ~token~0)) [2021-12-06 17:44:31,131 INFO L858 garLoopResultBuilder]: For program point L151-1(line 151) no Hoare annotation was computed. [2021-12-06 17:44:31,131 INFO L854 garLoopResultBuilder]: At program point L548(line 548) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_i~0 1) (<= 2 ~E_M~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~T2_E~0 ~M_E~0) (= ~t2_i~0 1) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2021-12-06 17:44:31,131 INFO L854 garLoopResultBuilder]: At program point L548-1(line 548) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_i~0 1) (<= 2 ~E_M~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~T2_E~0 ~M_E~0) (= ~t2_i~0 1) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2021-12-06 17:44:31,131 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-06 17:44:31,131 INFO L858 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2021-12-06 17:44:31,131 INFO L854 garLoopResultBuilder]: At program point L119(lines 90 125) the Hoare annotation is: (let ((.cse12 (<= ~t2_pc~0 0)) (.cse5 (<= 2 ~m_st~0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (let ((.cse18 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,131 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2021-12-06 17:44:31,132 INFO L854 garLoopResultBuilder]: At program point L565(line 565) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,132 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-12-06 17:44:31,132 INFO L854 garLoopResultBuilder]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,132 INFO L854 garLoopResultBuilder]: At program point L499-1(lines 470 507) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,132 INFO L854 garLoopResultBuilder]: At program point L334(lines 275 339) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,132 INFO L854 garLoopResultBuilder]: At program point L549(line 549) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_i~0 1) (<= 2 ~E_M~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~T2_E~0 ~M_E~0) (= ~t2_i~0 1) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2021-12-06 17:44:31,132 INFO L854 garLoopResultBuilder]: At program point L516(lines 508 518) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_i~0 1) (<= 2 ~E_M~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~T2_E~0 ~M_E~0) (= ~t2_i~0 1) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2021-12-06 17:44:31,132 INFO L854 garLoopResultBuilder]: At program point L54(lines 49 88) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (<= 2 ~E_1~0) (= ~t1_i~0 1) (<= ~token~0 (+ 2 ~local~0)) (<= 2 ~E_M~0) (<= 2 ~T1_E~0) (<= 2 ~E_2~0) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~t2_i~0 1) (< (+ ~local~0 1) ~token~0) (<= 2 ~t2_st~0)) [2021-12-06 17:44:31,133 INFO L854 garLoopResultBuilder]: At program point L566(line 566) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,133 INFO L854 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2021-12-06 17:44:31,133 INFO L854 garLoopResultBuilder]: At program point L467(lines 461 469) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,133 INFO L858 garLoopResultBuilder]: For program point L236-1(lines 230 248) no Hoare annotation was computed. [2021-12-06 17:44:31,133 INFO L858 garLoopResultBuilder]: For program point L484-1(lines 473 506) no Hoare annotation was computed. [2021-12-06 17:44:31,133 INFO L854 garLoopResultBuilder]: At program point L319(lines 281 333) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,133 INFO L858 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2021-12-06 17:44:31,133 INFO L858 garLoopResultBuilder]: For program point L286-1(lines 281 333) no Hoare annotation was computed. [2021-12-06 17:44:31,133 INFO L854 garLoopResultBuilder]: At program point L567(line 567) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,134 INFO L854 garLoopResultBuilder]: At program point L534(lines 523 536) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,134 INFO L854 garLoopResultBuilder]: At program point L105-1(lines 93 124) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse9 (= ~m_pc~0 0)) (.cse10 (= ~token~0 ~local~0)) (.cse13 (<= ~t2_pc~0 0)) (.cse12 (= 0 ~t2_st~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (<= 2 ~E_M~0)) (.cse14 (<= 2 ~m_st~0)) (.cse17 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (<= 2 ~E_2~0)) (.cse6 (= ~t2_pc~0 1)) (.cse15 (= ~m_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse11 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse12 .cse10 .cse13) (and .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse15 .cse7 .cse8 .cse12 .cse13) (let ((.cse16 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 (<= ~token~0 .cse16) .cse14 .cse17 .cse4 .cse5 .cse6 .cse15 .cse7 (<= .cse16 ~token~0) .cse8 .cse12)) (and .cse0 .cse1 .cse2 .cse14 .cse17 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse11))) [2021-12-06 17:44:31,134 INFO L854 garLoopResultBuilder]: At program point L155(lines 126 161) the Hoare annotation is: (let ((.cse5 (<= 2 ~m_st~0)) (.cse9 (= ~m_pc~0 1)) (.cse15 (<= ~t1_pc~0 0)) (.cse13 (= ~t1_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse16 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~t2_i~0 1)) (.cse17 (= ~m_pc~0 0)) (.cse14 (= ~token~0 ~local~0)) (.cse12 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< (+ ~local~0 1) ~token~0) .cse12) (and .cse2 .cse3 .cse4 .cse16 .cse15 .cse6 .cse13 .cse7 .cse8 .cse10 .cse11 .cse17 .cse14 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse6 .cse7 .cse8 .cse10 .cse11 .cse17 .cse14 .cse12))) [2021-12-06 17:44:31,134 INFO L854 garLoopResultBuilder]: At program point L535(lines 519 537) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,134 INFO L858 garLoopResultBuilder]: For program point L106(line 106) no Hoare annotation was computed. [2021-12-06 17:44:31,134 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2021-12-06 17:44:31,134 INFO L858 garLoopResultBuilder]: For program point L305(lines 281 333) no Hoare annotation was computed. [2021-12-06 17:44:31,134 INFO L854 garLoopResultBuilder]: At program point L553-1(lines 550 590) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,134 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 329) no Hoare annotation was computed. [2021-12-06 17:44:31,134 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-06 17:44:31,134 INFO L858 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2021-12-06 17:44:31,135 INFO L854 garLoopResultBuilder]: At program point L141-1(lines 129 160) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse13 (<= 2 ~t1_st~0)) (.cse14 (= ~m_st~0 0)) (.cse16 (= ~m_pc~0 0)) (.cse12 (= ~token~0 ~local~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (<= 2 ~m_st~0)) (.cse15 (<= ~t1_pc~0 0)) (.cse5 (<= 1 ~m_pc~0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (= ~m_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~t2_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse13 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 .cse14 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 (< (+ ~local~0 1) ~token~0)) (and .cse1 .cse2 .cse3 .cse14 .cse15 .cse6 .cse7 .cse8 .cse10 .cse11 .cse16 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse6 .cse8 .cse10 .cse11 .cse16 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-12-06 17:44:31,135 INFO L858 garLoopResultBuilder]: For program point L554(line 554) no Hoare annotation was computed. [2021-12-06 17:44:31,135 INFO L854 garLoopResultBuilder]: At program point L75-1(lines 49 88) the Hoare annotation is: (let ((.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~t1_st~0 0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~m_i~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse13 (= ~m_pc~0 0)) (.cse16 (= ~token~0 ~local~0)) (.cse10 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse5 .cse6 .cse7 (= ~m_pc~0 1) .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse8 .cse9 .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse13 .cse14 .cse16 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse16 .cse10))) [2021-12-06 17:44:31,135 INFO L854 garLoopResultBuilder]: At program point L241-1(lines 227 249) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_i~0 1) (<= 2 ~E_M~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~T2_E~0 ~M_E~0) (= ~t2_i~0 1) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2021-12-06 17:44:31,135 INFO L858 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2021-12-06 17:44:31,135 INFO L858 garLoopResultBuilder]: For program point L489-1(lines 473 506) no Hoare annotation was computed. [2021-12-06 17:44:31,135 INFO L858 garLoopResultBuilder]: For program point L291(lines 281 333) no Hoare annotation was computed. [2021-12-06 17:44:31,135 INFO L858 garLoopResultBuilder]: For program point L572(lines 572 581) no Hoare annotation was computed. [2021-12-06 17:44:31,135 INFO L858 garLoopResultBuilder]: For program point L572-2(lines 572 581) no Hoare annotation was computed. [2021-12-06 17:44:31,135 INFO L858 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2021-12-06 17:44:31,135 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2021-12-06 17:44:31,135 INFO L854 garLoopResultBuilder]: At program point L606(lines 597 608) the Hoare annotation is: (= ~m_i~0 1) [2021-12-06 17:44:31,135 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-06 17:44:31,135 INFO L858 garLoopResultBuilder]: For program point L474(lines 474 478) no Hoare annotation was computed. [2021-12-06 17:44:31,135 INFO L858 garLoopResultBuilder]: For program point L474-2(lines 473 506) no Hoare annotation was computed. [2021-12-06 17:44:31,136 INFO L858 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2021-12-06 17:44:31,136 INFO L854 garLoopResultBuilder]: At program point L591(lines 538 596) the Hoare annotation is: (= ~m_i~0 1) [2021-12-06 17:44:31,136 INFO L854 garLoopResultBuilder]: At program point L525(line 525) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,136 INFO L858 garLoopResultBuilder]: For program point L525-1(line 525) no Hoare annotation was computed. [2021-12-06 17:44:31,136 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 301) no Hoare annotation was computed. [2021-12-06 17:44:31,136 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 138) no Hoare annotation was computed. [2021-12-06 17:44:31,136 INFO L858 garLoopResultBuilder]: For program point L97(lines 97 101) no Hoare annotation was computed. [2021-12-06 17:44:31,136 INFO L854 garLoopResultBuilder]: At program point L576(line 576) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,136 INFO L858 garLoopResultBuilder]: For program point L576-1(line 576) no Hoare annotation was computed. [2021-12-06 17:44:31,136 INFO L858 garLoopResultBuilder]: For program point L527(lines 527 532) no Hoare annotation was computed. [2021-12-06 17:44:31,136 INFO L858 garLoopResultBuilder]: For program point L494-1(lines 473 506) no Hoare annotation was computed. [2021-12-06 17:44:31,136 INFO L854 garLoopResultBuilder]: At program point L98(lines 93 124) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ~m_i~0 1)) (.cse9 (= ~t2_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~t2_pc~0 1) .cse7 .cse8 .cse9 (= ~token~0 ~local~0) (<= 2 ~t2_st~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 0 ~t2_st~0) (<= ~t2_pc~0 0)))) [2021-12-06 17:44:31,136 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-06 17:44:31,137 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-12-06 17:44:31,137 INFO L854 garLoopResultBuilder]: At program point L115(line 115) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (<= 2 ~m_st~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~t2_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_st~0) (<= ~t2_pc~0 0)) (let ((.cse9 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 .cse9) .cse4 .cse5 (= ~t2_pc~0 1) .cse6 .cse7 (<= .cse9 ~token~0) .cse8 (<= 2 ~t2_st~0))))) [2021-12-06 17:44:31,137 INFO L858 garLoopResultBuilder]: For program point L115-1(line 115) no Hoare annotation was computed. [2021-12-06 17:44:31,137 INFO L854 garLoopResultBuilder]: At program point L561(line 561) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,137 INFO L858 garLoopResultBuilder]: For program point L561-1(line 561) no Hoare annotation was computed. [2021-12-06 17:44:31,137 INFO L858 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2021-12-06 17:44:31,137 INFO L858 garLoopResultBuilder]: For program point L231-2(lines 230 248) no Hoare annotation was computed. [2021-12-06 17:44:31,137 INFO L858 garLoopResultBuilder]: For program point L479-1(lines 473 506) no Hoare annotation was computed. [2021-12-06 17:44:31,137 INFO L854 garLoopResultBuilder]: At program point L83(lines 46 89) the Hoare annotation is: (let ((.cse1 (<= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse16 (= ~token~0 ~local~0)) (.cse13 (= ~t2_pc~0 1)) (.cse14 (<= 2 ~t2_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 2 ~m_st~0)) (.cse17 (<= ~t1_pc~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse15 (= ~t1_st~0 0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~m_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse13 .cse8 .cse9 .cse10 .cse16 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse15 .cse7 .cse13 .cse8 .cse9 .cse10 .cse14) (and .cse2 .cse3 .cse4 .cse5 .cse17 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-12-06 17:44:31,137 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 58) no Hoare annotation was computed. [2021-12-06 17:44:31,137 INFO L858 garLoopResultBuilder]: For program point L133(lines 133 137) no Hoare annotation was computed. [2021-12-06 17:44:31,137 INFO L854 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse12 (= ~t2_pc~0 1)) (.cse10 (= ~token~0 ~local~0)) (.cse13 (<= 2 ~t2_st~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (<= 2 ~E_M~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse4 (<= 2 ~T1_E~0)) (.cse15 (= ~t1_st~0 0)) (.cse5 (<= 2 ~E_2~0)) (.cse6 (= ~m_i~0 1)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= 0 ~t2_st~0)) (.cse11 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 (= ~m_pc~0 1) .cse6 .cse7 .cse10 .cse13) (and .cse2 .cse3 .cse14 .cse4 .cse15 .cse5 .cse12 .cse6 .cse7 .cse8 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse10 .cse13) (and .cse2 .cse3 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11))) [2021-12-06 17:44:31,137 INFO L854 garLoopResultBuilder]: At program point L546(line 546) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (= ~E_1~0 ~M_E~0) (= ~t1_i~0 1) (<= 2 ~E_M~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~T2_E~0 ~M_E~0) (= ~t2_i~0 1) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~t2_pc~0 0)) [2021-12-06 17:44:31,138 INFO L858 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2021-12-06 17:44:31,138 INFO L858 garLoopResultBuilder]: For program point L546-1(line 546) no Hoare annotation was computed. [2021-12-06 17:44:31,138 INFO L854 garLoopResultBuilder]: At program point L282(line 282) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse5 (<= 2 ~m_st~0)) (.cse20 (<= ~t1_pc~0 0)) (.cse19 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 1)) (.cse11 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (<= 2 ~T1_E~0)) (.cse7 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~t2_i~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse17 (<= 2 ~t2_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse18) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 (<= .cse18 ~token~0) .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse9 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse13 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 (< .cse18 ~token~0) .cse17) (and .cse2 .cse3 .cse4 .cse13 .cse20 .cse6 .cse19 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17) (and .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 .cse16 .cse9 .cse10 .cse14 .cse15 .cse17))) [2021-12-06 17:44:31,138 INFO L854 garLoopResultBuilder]: At program point L134(lines 129 160) the Hoare annotation is: (let ((.cse0 (+ ~local~0 1))) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (<= 2 ~E_1~0) (= ~t1_i~0 1) (<= 2 ~E_M~0) (<= ~token~0 .cse0) (<= 2 ~m_st~0) (<= 2 ~T1_E~0) (<= 2 ~E_2~0) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (<= .cse0 ~token~0) (= ~t2_i~0 1))) [2021-12-06 17:44:31,140 INFO L732 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] [2021-12-06 17:44:31,141 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:44:31,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:44:31 BoogieIcfgContainer [2021-12-06 17:44:31,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:44:31,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:44:31,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:44:31,215 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:44:31,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:41:41" (3/4) ... [2021-12-06 17:44:31,218 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-06 17:44:31,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-12-06 17:44:31,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-12-06 17:44:31,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-12-06 17:44:31,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-12-06 17:44:31,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-12-06 17:44:31,223 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-12-06 17:44:31,230 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-12-06 17:44:31,230 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-06 17:44:31,231 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-06 17:44:31,231 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-06 17:44:31,250 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2)) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1))) && ((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((m_st == \old(m_st) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((m_st == \old(m_st) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((m_st == \old(m_st) && t1_st == 0) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_2)) || !(token == local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((m_st == \old(m_st) && t1_st == 0) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(2 <= E_2))) && ((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((m_st == \old(m_st) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_2))) && (((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) [2021-12-06 17:44:31,250 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((((((0 <= \result && \result <= 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0) || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((((((((0 <= \result && \result <= 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0) || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2))) && ((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((((0 <= \result && \result <= 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0) || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_2))) && ((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && m_st == \old(m_st)) && t1_st == 0) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && m_st == \old(m_st)) && t1_st == 0) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(2 <= E_2)) [2021-12-06 17:44:31,251 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || ((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) && (((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || ((((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && m_st == 0) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || ((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || ((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (((\old(t1_st) == t1_st && \old(t2_st) == t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || ((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || \old(t2_st) == t2_st) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || ((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && (((m_st == \old(m_st) && t1_st == 0) && 0 == t2_st) || ((m_st == 0 && t1_st == 0) && 0 == t2_st))) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || ((\old(t1_st) == t1_st && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || ((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || ((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(m_i == 1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((((2 <= t1_st && m_st == 0) && __retres1 <= 0) && 0 <= __retres1) || !(local + 1 < token)) || !(t2_i == 1)) || ((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_2)) || (((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 0 <= __retres1) && tmp <= 0) && ((m_st == 0 && t1_st == 0) || ((m_st == \old(m_st) && \old(t2_st) == t2_st) && t1_st == 0))) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || ((((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && m_st == 0) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || ((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && (((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && (((((((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && 2 <= E_M) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st))) || !(t2_i == 1)) || (((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && (((((((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && 2 <= E_M) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st))) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_2)) || !(token == local)) [2021-12-06 17:44:31,252 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && (((m_st == \old(m_st) && t1_st == 0) && 0 == t2_st) || ((m_st == 0 && t1_st == 0) && 0 == t2_st))) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_2)) && (((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || ((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || ((((\old(t1_st) == t1_st && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (((((\old(t1_st) == t1_st && \old(t2_st) == t2_st) && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || ((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || (((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && ((m_st == 0 && t1_st == 0) || ((m_st == \old(m_st) && \old(t2_st) == t2_st) && t1_st == 0))) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_2))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || ((((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || ((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || ((((((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && m_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_2)) || ((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || \old(t2_st) == t2_st) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || ((((((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && m_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_2)) || ((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && (((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && (((((((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && 2 <= E_M) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st))) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || (((((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && (((((((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && 2 <= E_M) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st))) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (((((2 <= t1_st && m_st == 0) && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || ((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || ((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2)) [2021-12-06 17:44:31,252 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) || !(2 <= E_2)) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || ((((\old(t1_st) == t1_st && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (((((\old(t1_st) == t1_st && \old(t2_st) == t2_st) && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((((((((((__retres1 <= 0 && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (((((((((2 <= t1_st && __retres1 <= 0) && tmp___0 <= 0) && m_st == 0) && 0 < tmp___0 + 1) && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((((((!(\old(t1_st) == 0) || (m_st == \old(m_st) && t1_st == 0)) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && ((m_st == 0 && 0 == t2_st) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 == t2_st))) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || (((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1) || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_2))) && (((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || (((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || ((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || ((((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && (((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) || m_st == 0)) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_M)) || !(t2_pc == 1)) || (((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || ((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || ((((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && (((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) || m_st == 0)) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_M)) || !(t2_pc == 1)) || (((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || (((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || (m_st == \old(m_st) && \old(t2_st) == t2_st)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || (((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_M)) || !(local + 1 <= token)) || ((((((((((((((0 <= \result && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || m_st == \old(m_st)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((((((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || ((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local)) [2021-12-06 17:44:31,252 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || (((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || !(t2_pc == 1)) || ((((((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && 0 <= \result) && (((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) || m_st == 0)) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local)) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || ((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || ((((\old(t1_st) == t1_st && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (((((\old(t1_st) == t1_st && \old(t2_st) == t2_st) && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || (m_st == \old(m_st) && t1_st == 0)) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || (((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || ((((((((((((((0 <= \result && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || (((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || (((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 0 == t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || (((((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && ((m_st == 0 && 0 == t2_st) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 == t2_st))) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || (((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || (((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || !(t2_pc == 1)) || ((((((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && 0 <= \result) && (((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) || m_st == 0)) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || (m_st == \old(m_st) && \old(t2_st) == t2_st)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || (((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && tmp___0 <= 0) && m_st == 0) && 0 < tmp___0 + 1) && \result <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || ((((((((((((((__retres1 <= 0 && 0 <= \result) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || (((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_2))) && (((((((((((((((((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1) || !(local + 1 < token)) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || m_st == \old(m_st)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local)) [2021-12-06 17:44:31,288 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 17:44:31,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:44:31,289 INFO L158 Benchmark]: Toolchain (without parser) took 170191.67ms. Allocated memory was 88.1MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 51.9MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2021-12-06 17:44:31,289 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 88.1MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:44:31,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.95ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 51.7MB in the beginning and 81.0MB in the end (delta: -29.3MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2021-12-06 17:44:31,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.59ms. Allocated memory is still 107.0MB. Free memory was 81.0MB in the beginning and 78.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:44:31,290 INFO L158 Benchmark]: Boogie Preprocessor took 31.29ms. Allocated memory is still 107.0MB. Free memory was 78.8MB in the beginning and 77.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:44:31,290 INFO L158 Benchmark]: RCFGBuilder took 382.66ms. Allocated memory is still 107.0MB. Free memory was 77.1MB in the beginning and 60.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-06 17:44:31,290 INFO L158 Benchmark]: TraceAbstraction took 169390.50ms. Allocated memory was 107.0MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 84.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2021-12-06 17:44:31,290 INFO L158 Benchmark]: Witness Printer took 73.29ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.7GB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 17:44:31,292 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.13ms. Allocated memory is still 88.1MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.95ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 51.7MB in the beginning and 81.0MB in the end (delta: -29.3MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.59ms. Allocated memory is still 107.0MB. Free memory was 81.0MB in the beginning and 78.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.29ms. Allocated memory is still 107.0MB. Free memory was 78.8MB in the beginning and 77.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 382.66ms. Allocated memory is still 107.0MB. Free memory was 77.1MB in the beginning and 60.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 169390.50ms. Allocated memory was 107.0MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 84.2MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 73.29ms. Allocated memory is still 2.8GB. Free memory was 1.8GB in the beginning and 1.7GB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 169.3s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 122.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6373 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6213 mSDsluCounter, 14067 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7550 mSDsCounter, 708 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5957 IncrementalHoareTripleChecker+Invalid, 6665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 708 mSolverCounterUnsat, 6517 mSDtfsCounter, 5957 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3578 GetRequests, 3349 SyntacticMatches, 6 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36831occurred in iteration=15, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 19139 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 49 LocationsWithAnnotation, 69732 PreInvPairs, 71324 NumberOfFragments, 22827 HoareAnnotationTreeSize, 69732 FomulaSimplifications, 4725 FormulaSimplificationTreeSizeReduction, 79.1s HoareSimplificationTime, 49 FomulaSimplificationsInter, 11759044 FormulaSimplificationTreeSizeReductionInter, 42.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 6610 NumberOfCodeBlocks, 6610 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 6564 ConstructedInterpolants, 0 QuantifiedInterpolants, 10649 SizeOfPredicates, 9 NumberOfNonLiveVariables, 8990 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 46 InterpolantComputations, 28 PerfectInterpolantSequences, 3369/3873 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: 49]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && local + 1 < token) && 2 <= t2_st - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && token == local) && 2 <= t2_st) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2)) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1))) && ((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((m_st == \old(m_st) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((m_st == \old(m_st) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((m_st == \old(m_st) && t1_st == 0) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_2)) || !(token == local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((m_st == \old(m_st) && t1_st == 0) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(2 <= E_2))) && ((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((m_st == \old(m_st) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_2))) && (((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((((((0 <= \result && \result <= 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0) || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((((((((0 <= \result && \result <= 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0) || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2))) && ((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((((0 <= \result && \result <= 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && __retres1 <= 0) || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_2))) && ((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(t2_pc == 1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && __retres1 <= 0)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && m_st == \old(m_st)) && t1_st == 0) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && m_st == \old(m_st)) && t1_st == 0) && 0 <= __retres1) && 0 == t2_st) && __retres1 <= 0)) || !(2 <= E_2)) - InvariantResult [Line: 470]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && token <= local + 1) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && t2_i == 1) && 0 == t2_st)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && token == local) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && local + 1 < token) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st) - InvariantResult [Line: 538]: Loop Invariant Derived loop invariant: m_i == 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && token == local) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 <= E_M) && m_st == 0) && 1 <= m_pc) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && local + 1 < token)) || (((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local)) || (((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1)) || (((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local)) || (((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) || !(2 <= E_2)) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || ((((\old(t1_st) == t1_st && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (((((\old(t1_st) == t1_st && \old(t2_st) == t2_st) && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((((((((((__retres1 <= 0 && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (((((((((2 <= t1_st && __retres1 <= 0) && tmp___0 <= 0) && m_st == 0) && 0 < tmp___0 + 1) && \result <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((((((!(\old(t1_st) == 0) || (m_st == \old(m_st) && t1_st == 0)) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && ((m_st == 0 && 0 == t2_st) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 == t2_st))) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || (((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1) || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_2))) && (((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || (((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || ((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || ((((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && (((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) || m_st == 0)) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_M)) || !(t2_pc == 1)) || (((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || ((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || ((((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && (((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) || m_st == 0)) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_M)) || !(t2_pc == 1)) || (((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || (((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || (m_st == \old(m_st) && \old(t2_st) == t2_st)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || (((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_M)) || !(local + 1 <= token)) || ((((((((((((((0 <= \result && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || m_st == \old(m_st)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((((((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || ((((((((((((((((__retres1 <= 0 && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && token == local) && 2 <= t2_st)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && local + 1 < token) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st)) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st) - InvariantResult [Line: 508]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && t1_st == 0) && m_i == 1) && T2_E == M_E) && t2_i == 1) && m_pc == 0) && E_2 == M_E) && 0 == t2_st) && token == local) && M_E == 2) && t2_pc <= 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && (((m_st == \old(m_st) && t1_st == 0) && 0 == t2_st) || ((m_st == 0 && t1_st == 0) && 0 == t2_st))) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_2)) && (((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || ((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || ((((\old(t1_st) == t1_st && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (((((\old(t1_st) == t1_st && \old(t2_st) == t2_st) && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || ((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || (((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && ((m_st == 0 && t1_st == 0) || ((m_st == \old(m_st) && \old(t2_st) == t2_st) && t1_st == 0))) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_2))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || ((((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || ((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || ((((((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && m_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_2)) || ((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || \old(t2_st) == t2_st) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || ((((((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && m_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_2)) || ((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && (((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && (((((((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && 2 <= E_M) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st))) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || (((((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && (((((((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && 2 <= E_M) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st))) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (((((2 <= t1_st && m_st == 0) && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || ((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || ((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2)) - InvariantResult [Line: 597]: Loop Invariant Derived loop invariant: m_i == 1 - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && token <= local + 1) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && t2_i == 1) && 0 == t2_st)) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && token <= local + 1) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && t2_i == 1) && 0 == t2_st)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && token == local) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && local + 1 < token) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || (((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || !(t2_pc == 1)) || ((((((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && 0 <= \result) && (((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) || m_st == 0)) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local)) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || ((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || ((((\old(t1_st) == t1_st && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (((((\old(t1_st) == t1_st && \old(t2_st) == t2_st) && \result <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || (m_st == \old(m_st) && t1_st == 0)) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || (((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || ((((((((((((((0 <= \result && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || (((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || (((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 0 == t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || (((((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && ((m_st == 0 && 0 == t2_st) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 == t2_st))) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || (((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || (((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || !(t2_pc == 1)) || ((((((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && 0 <= \result) && (((\old(t1_st) == t1_st && m_st == \old(m_st)) && \old(t2_st) == t2_st) || m_st == 0)) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && 0 <= __retres1) && tmp <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || (m_st == \old(m_st) && \old(t2_st) == t2_st)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || (((((((((((2 <= t1_st && __retres1 <= 0) && 0 <= \result) && tmp___0 <= 0) && m_st == 0) && 0 < tmp___0 + 1) && \result <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || ((((((((((((((__retres1 <= 0 && 0 <= \result) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || (((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_2))) && (((((((((((((((((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1) || !(local + 1 < token)) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1) || !(t2_i == 1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || m_st == \old(m_st)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 < tmp___0 + 1) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || ((((((((((((((((((__retres1 <= 0 && 0 <= \result) && 0 <= \result) && \result <= 0) && tmp___0 <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 < tmp___0 + 1) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= __retres1) && 0 <= \result) && 0 <= __retres1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local)) - InvariantResult [Line: 523]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && token <= local + 1) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && t2_i == 1) && 0 == t2_st)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && token == local) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && local + 1 < token) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && token <= local + 1) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && t2_i == 1 - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(t2_i == 1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || ((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_1)) && (((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || ((((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && m_st == 0) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || ((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || ((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || (((\old(t1_st) == t1_st && \old(t2_st) == t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || ((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1)) || !(2 <= E_2))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 0 == t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || \old(t2_st) == t2_st) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || ((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || ((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && (((m_st == \old(m_st) && t1_st == 0) && 0 == t2_st) || ((m_st == 0 && t1_st == 0) && 0 == t2_st))) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || ((\old(t1_st) == t1_st && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token == local))) && (((((((((((((!(t2_i == 1) || ((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_i == 1)) || !(2 <= E_M)) || !(local + 1 <= token)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || ((((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(m_i == 1)) || !(m_pc == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((((2 <= t1_st && m_st == 0) && __retres1 <= 0) && 0 <= __retres1) || !(local + 1 < token)) || !(t2_i == 1)) || ((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(2 <= T1_E)) || !(m_i == 1)) || !(2 <= \old(t2_st))) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || !(2 <= E_2)) || (((((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 0 <= __retres1) && tmp <= 0) && ((m_st == 0 && t1_st == 0) || ((m_st == \old(m_st) && \old(t2_st) == t2_st) && t1_st == 0))) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1))) && (((((((((((((!(t2_i == 1) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(t1_pc == 1)) || !(2 <= \old(t2_st))) || !(m_pc == 0)) || !(t1_i == 1)) || !(2 <= E_M)) || !(t2_pc == 1)) || ((((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && m_st == 0) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && 2 <= t2_st) && __retres1 <= 0) && 0 <= __retres1)) || !(2 <= E_2)) || ((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && (((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && (((((((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && 2 <= E_M) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st))) || !(t2_i == 1)) || (((((((((2 <= t1_st && 0 <= \result) && \result <= 0) && 0 < tmp + 1) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && (((((((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && 2 <= E_M) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) || ((((((((t1_pc == 1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st))) && 0 <= __retres1)) || !(2 <= \old(t1_st))) || !(2 <= T1_E)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || !(2 <= E_M)) || !(2 <= E_2)) || !(token == local)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0) || ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && token == local) && 2 <= t2_st)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && token <= local + 1) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && t2_i == 1) && 0 == t2_st)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && token == local) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && local + 1 < token) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st) || (((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && token <= local + 1) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && t2_i == 1) && 0 == t2_st)) || (((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && local + 1 < token) && 2 <= t2_st) || (((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && t2_pc <= 0)) || (((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && 2 <= t2_st)) || ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && E_1 == M_E) && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && t1_st == 0) && m_i == 1) && T2_E == M_E) && t2_i == 1) && m_pc == 0) && E_2 == M_E) && 0 == t2_st) && token == local) && M_E == 2) && t2_pc <= 0 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && token <= local + 1) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && t2_i == 1) && 0 == t2_st)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && token == local) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && local + 1 < token) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st) - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && token <= local + 1) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && t2_i == 1) && 0 == t2_st)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && token == local) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && local + 1 < token) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && token <= local + 1) && 2 <= m_st) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && t2_i == 1) && 0 == t2_st)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && token == local) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_i == 1) && t2_i == 1) && m_pc == 0) && 0 == t2_st) && token == local) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && token == local) && t2_pc <= 0)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && 2 <= t2_st)) || ((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_pc == 1) && m_i == 1) && t2_i == 1) && local + 1 < token) && 2 <= t2_st)) || (((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st)) || ((((((((((((2 <= E_1 && t1_i == 1) && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && t1_st == 0) && 2 <= E_2) && m_pc == 1) && m_i == 1) && t2_i == 1) && 0 == t2_st) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && 2 <= E_2) && t2_pc == 1) && m_i == 1) && t2_i == 1) && m_pc == 0) && token == local) && 2 <= t2_st) RESULT: Ultimate proved your program to be correct! [2021-12-06 17:44:31,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f4ee4e8c-5d97-4a4f-a33b-4e963933f0ca/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE