./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_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 19:33:53,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 19:33:53,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 19:33:53,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 19:33:53,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 19:33:53,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 19:33:53,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 19:33:53,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 19:33:53,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 19:33:53,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 19:33:53,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 19:33:53,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 19:33:53,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 19:33:53,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 19:33:53,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 19:33:53,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 19:33:53,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 19:33:53,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 19:33:53,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 19:33:53,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 19:33:53,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 19:33:53,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 19:33:53,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 19:33:53,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 19:33:53,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 19:33:53,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 19:33:53,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 19:33:53,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 19:33:53,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 19:33:53,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 19:33:53,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 19:33:53,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 19:33:53,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 19:33:53,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 19:33:53,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 19:33:53,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 19:33:53,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 19:33:53,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 19:33:53,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 19:33:53,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 19:33:53,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 19:33:53,598 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 19:33:53,631 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 19:33:53,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 19:33:53,632 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 19:33:53,632 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 19:33:53,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 19:33:53,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 19:33:53,633 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 19:33:53,633 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 19:33:53,633 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 19:33:53,634 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 19:33:53,634 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 19:33:53,634 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 19:33:53,634 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 19:33:53,634 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 19:33:53,634 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 19:33:53,635 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 19:33:53,635 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 19:33:53,635 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 19:33:53,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 19:33:53,636 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 19:33:53,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 19:33:53,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 19:33:53,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 19:33:53,637 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 19:33:53,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 19:33:53,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 19:33:53,637 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 19:33:53,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 19:33:53,638 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 19:33:53,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 19:33:53,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 19:33:53,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 19:33:53,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:33:53,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 19:33:53,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 19:33:53,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 19:33:53,639 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 19:33:53,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 19:33:53,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 19:33:53,640 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 19:33:53,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 19:33:53,640 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/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_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2021-11-25 19:33:53,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 19:33:53,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 19:33:53,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 19:33:53,933 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 19:33:53,934 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 19:33:53,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-11-25 19:33:54,008 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/data/9949a4142/6a79555557f0415bb07db17921532988/FLAG1c8d35b4b [2021-11-25 19:33:54,477 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 19:33:54,477 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-11-25 19:33:54,487 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/data/9949a4142/6a79555557f0415bb07db17921532988/FLAG1c8d35b4b [2021-11-25 19:33:54,890 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/data/9949a4142/6a79555557f0415bb07db17921532988 [2021-11-25 19:33:54,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 19:33:54,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 19:33:54,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 19:33:54,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 19:33:54,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 19:33:54,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:33:54" (1/1) ... [2021-11-25 19:33:54,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71262df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:54, skipping insertion in model container [2021-11-25 19:33:54,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 07:33:54" (1/1) ... [2021-11-25 19:33:54,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 19:33:54,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 19:33:55,214 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_21e0334d-a834-4712-a9cb-e6fe0710fc56/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2021-11-25 19:33:55,270 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:33:55,278 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 19:33:55,289 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_21e0334d-a834-4712-a9cb-e6fe0710fc56/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2021-11-25 19:33:55,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 19:33:55,347 INFO L208 MainTranslator]: Completed translation [2021-11-25 19:33:55,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55 WrapperNode [2021-11-25 19:33:55,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 19:33:55,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 19:33:55,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 19:33:55,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 19:33:55,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55" (1/1) ... [2021-11-25 19:33:55,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55" (1/1) ... [2021-11-25 19:33:55,390 INFO L137 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 273 [2021-11-25 19:33:55,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 19:33:55,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 19:33:55,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 19:33:55,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 19:33:55,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55" (1/1) ... [2021-11-25 19:33:55,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55" (1/1) ... [2021-11-25 19:33:55,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55" (1/1) ... [2021-11-25 19:33:55,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55" (1/1) ... [2021-11-25 19:33:55,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55" (1/1) ... [2021-11-25 19:33:55,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55" (1/1) ... [2021-11-25 19:33:55,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55" (1/1) ... [2021-11-25 19:33:55,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 19:33:55,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 19:33:55,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 19:33:55,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 19:33:55,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55" (1/1) ... [2021-11-25 19:33:55,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 19:33:55,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:33:55,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 19:33:55,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 19:33:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 19:33:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-11-25 19:33:55,499 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-11-25 19:33:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-11-25 19:33:55,499 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-11-25 19:33:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-11-25 19:33:55,500 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-11-25 19:33:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-11-25 19:33:55,500 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-11-25 19:33:55,500 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-11-25 19:33:55,500 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-11-25 19:33:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 19:33:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-11-25 19:33:55,501 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-11-25 19:33:55,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 19:33:55,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 19:33:55,565 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 19:33:55,567 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 19:33:55,984 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 19:33:56,124 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 19:33:56,125 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-25 19:33:56,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:33:56 BoogieIcfgContainer [2021-11-25 19:33:56,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 19:33:56,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 19:33:56,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 19:33:56,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 19:33:56,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 07:33:54" (1/3) ... [2021-11-25 19:33:56,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71facf81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:33:56, skipping insertion in model container [2021-11-25 19:33:56,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 07:33:55" (2/3) ... [2021-11-25 19:33:56,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71facf81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 07:33:56, skipping insertion in model container [2021-11-25 19:33:56,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:33:56" (3/3) ... [2021-11-25 19:33:56,140 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2021-11-25 19:33:56,151 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 19:33:56,152 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 19:33:56,214 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 19:33:56,221 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 19:33:56,221 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-25 19:33:56,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 56 states have internal predecessors, (80), 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-11-25 19:33:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-25 19:33:56,262 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:33:56,263 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] [2021-11-25 19:33:56,263 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:33:56,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:33:56,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1952637331, now seen corresponding path program 1 times [2021-11-25 19:33:56,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:33:56,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463317210] [2021-11-25 19:33:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:33:56,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:33:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:33:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:33:56,552 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:33:56,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463317210] [2021-11-25 19:33:56,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463317210] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:33:56,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:33:56,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:33:56,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924033506] [2021-11-25 19:33:56,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:33:56,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:33:56,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:33:56,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:33:56,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:33:56,592 INFO L87 Difference]: Start difference. First operand has 78 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 56 states have internal predecessors, (80), 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 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-25 19:33:56,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:33:56,922 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2021-11-25 19:33:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:33:56,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 1 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 36 [2021-11-25 19:33:56,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:33:56,938 INFO L225 Difference]: With dead ends: 218 [2021-11-25 19:33:56,938 INFO L226 Difference]: Without dead ends: 141 [2021-11-25 19:33:56,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:33:56,949 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 182 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:33:56,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 250 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:33:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-25 19:33:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2021-11-25 19:33:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 101 states have internal predecessors, (136), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2021-11-25 19:33:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2021-11-25 19:33:57,009 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 36 [2021-11-25 19:33:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:33:57,010 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2021-11-25 19:33:57,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-25 19:33:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2021-11-25 19:33:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-25 19:33:57,015 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:33:57,015 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:33:57,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 19:33:57,016 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:33:57,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:33:57,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1406268527, now seen corresponding path program 1 times [2021-11-25 19:33:57,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:33:57,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479921664] [2021-11-25 19:33:57,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:33:57,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:33:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:33:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-25 19:33:57,184 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:33:57,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479921664] [2021-11-25 19:33:57,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479921664] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:33:57,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604661881] [2021-11-25 19:33:57,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:33:57,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:33:57,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:33:57,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:33:57,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 19:33:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:33:57,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 19:33:57,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:33:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-25 19:33:57,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:33:57,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604661881] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:33:57,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:33:57,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2021-11-25 19:33:57,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497952756] [2021-11-25 19:33:57,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:33:57,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:33:57,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:33:57,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:33:57,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:33:57,536 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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-11-25 19:33:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:33:57,670 INFO L93 Difference]: Finished difference Result 403 states and 559 transitions. [2021-11-25 19:33:57,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:33:57,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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 65 [2021-11-25 19:33:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:33:57,675 INFO L225 Difference]: With dead ends: 403 [2021-11-25 19:33:57,678 INFO L226 Difference]: Without dead ends: 268 [2021-11-25 19:33:57,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:33:57,684 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 82 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:33:57,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 194 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:33:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-25 19:33:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2021-11-25 19:33:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 189 states have (on average 1.3597883597883598) internal successors, (257), 192 states have internal predecessors, (257), 50 states have call successors, (50), 24 states have call predecessors, (50), 24 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-25 19:33:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 357 transitions. [2021-11-25 19:33:57,723 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 357 transitions. Word has length 65 [2021-11-25 19:33:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:33:57,724 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 357 transitions. [2021-11-25 19:33:57,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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-11-25 19:33:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 357 transitions. [2021-11-25 19:33:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-25 19:33:57,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:33:57,729 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:33:57,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-25 19:33:57,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:33:57,949 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:33:57,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:33:57,949 INFO L85 PathProgramCache]: Analyzing trace with hash -51451855, now seen corresponding path program 1 times [2021-11-25 19:33:57,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:33:57,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777670613] [2021-11-25 19:33:57,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:33:57,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:33:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:33:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-25 19:33:58,093 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:33:58,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777670613] [2021-11-25 19:33:58,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777670613] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:33:58,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:33:58,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 19:33:58,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964321195] [2021-11-25 19:33:58,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:33:58,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:33:58,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:33:58,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:33:58,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:33:58,097 INFO L87 Difference]: Start difference. First operand 264 states and 357 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-25 19:33:58,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:33:58,373 INFO L93 Difference]: Finished difference Result 808 states and 1094 transitions. [2021-11-25 19:33:58,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 19:33:58,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 65 [2021-11-25 19:33:58,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:33:58,381 INFO L225 Difference]: With dead ends: 808 [2021-11-25 19:33:58,381 INFO L226 Difference]: Without dead ends: 550 [2021-11-25 19:33:58,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-25 19:33:58,384 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 244 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:33:58,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 239 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:33:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-11-25 19:33:58,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 496. [2021-11-25 19:33:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 355 states have (on average 1.3380281690140845) internal successors, (475), 360 states have internal predecessors, (475), 92 states have call successors, (92), 48 states have call predecessors, (92), 48 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2021-11-25 19:33:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 659 transitions. [2021-11-25 19:33:58,450 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 659 transitions. Word has length 65 [2021-11-25 19:33:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:33:58,451 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 659 transitions. [2021-11-25 19:33:58,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-25 19:33:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 659 transitions. [2021-11-25 19:33:58,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-25 19:33:58,465 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:33:58,465 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:33:58,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 19:33:58,466 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:33:58,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:33:58,466 INFO L85 PathProgramCache]: Analyzing trace with hash 141324835, now seen corresponding path program 1 times [2021-11-25 19:33:58,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:33:58,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518486993] [2021-11-25 19:33:58,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:33:58,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:33:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:33:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-25 19:33:58,598 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:33:58,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518486993] [2021-11-25 19:33:58,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518486993] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:33:58,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:33:58,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-25 19:33:58,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438379292] [2021-11-25 19:33:58,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:33:58,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:33:58,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:33:58,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:33:58,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:33:58,601 INFO L87 Difference]: Start difference. First operand 496 states and 659 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-25 19:33:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:33:58,877 INFO L93 Difference]: Finished difference Result 1240 states and 1655 transitions. [2021-11-25 19:33:58,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 19:33:58,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2021-11-25 19:33:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:33:58,889 INFO L225 Difference]: With dead ends: 1240 [2021-11-25 19:33:58,890 INFO L226 Difference]: Without dead ends: 750 [2021-11-25 19:33:58,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-25 19:33:58,901 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 223 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:33:58,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 219 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:33:58,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-11-25 19:33:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 724. [2021-11-25 19:33:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 517 states have (on average 1.321083172147002) internal successors, (683), 524 states have internal predecessors, (683), 134 states have call successors, (134), 72 states have call predecessors, (134), 72 states have return successors, (134), 128 states have call predecessors, (134), 134 states have call successors, (134) [2021-11-25 19:33:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 951 transitions. [2021-11-25 19:33:59,009 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 951 transitions. Word has length 66 [2021-11-25 19:33:59,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:33:59,011 INFO L470 AbstractCegarLoop]: Abstraction has 724 states and 951 transitions. [2021-11-25 19:33:59,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-25 19:33:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 951 transitions. [2021-11-25 19:33:59,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-25 19:33:59,017 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:33:59,017 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:33:59,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 19:33:59,018 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:33:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:33:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash 616127469, now seen corresponding path program 1 times [2021-11-25 19:33:59,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:33:59,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642377819] [2021-11-25 19:33:59,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:33:59,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:33:59,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:33:59,131 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-25 19:33:59,131 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:33:59,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642377819] [2021-11-25 19:33:59,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642377819] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:33:59,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:33:59,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:33:59,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415987763] [2021-11-25 19:33:59,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:33:59,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:33:59,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:33:59,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:33:59,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:33:59,134 INFO L87 Difference]: Start difference. First operand 724 states and 951 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 19:33:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:33:59,233 INFO L93 Difference]: Finished difference Result 1269 states and 1679 transitions. [2021-11-25 19:33:59,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:33:59,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2021-11-25 19:33:59,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:33:59,240 INFO L225 Difference]: With dead ends: 1269 [2021-11-25 19:33:59,240 INFO L226 Difference]: Without dead ends: 897 [2021-11-25 19:33:59,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:33:59,243 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 36 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:33:59,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 215 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:33:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-11-25 19:33:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 804. [2021-11-25 19:33:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 585 states have (on average 1.335042735042735) internal successors, (781), 592 states have internal predecessors, (781), 140 states have call successors, (140), 78 states have call predecessors, (140), 78 states have return successors, (140), 134 states have call predecessors, (140), 140 states have call successors, (140) [2021-11-25 19:33:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1061 transitions. [2021-11-25 19:33:59,309 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1061 transitions. Word has length 67 [2021-11-25 19:33:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:33:59,309 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 1061 transitions. [2021-11-25 19:33:59,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-25 19:33:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1061 transitions. [2021-11-25 19:33:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-25 19:33:59,314 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:33:59,314 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:33:59,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-25 19:33:59,314 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:33:59,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:33:59,315 INFO L85 PathProgramCache]: Analyzing trace with hash 981825165, now seen corresponding path program 1 times [2021-11-25 19:33:59,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:33:59,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037269068] [2021-11-25 19:33:59,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:33:59,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:33:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:33:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-25 19:33:59,368 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:33:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037269068] [2021-11-25 19:33:59,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037269068] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:33:59,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:33:59,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 19:33:59,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603422684] [2021-11-25 19:33:59,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:33:59,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:33:59,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:33:59,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:33:59,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:33:59,392 INFO L87 Difference]: Start difference. First operand 804 states and 1061 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-25 19:33:59,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:33:59,513 INFO L93 Difference]: Finished difference Result 2000 states and 2655 transitions. [2021-11-25 19:33:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:33:59,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 86 [2021-11-25 19:33:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:33:59,523 INFO L225 Difference]: With dead ends: 2000 [2021-11-25 19:33:59,523 INFO L226 Difference]: Without dead ends: 1201 [2021-11-25 19:33:59,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 19:33:59,527 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 75 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:33:59,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 195 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:33:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2021-11-25 19:33:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1190. [2021-11-25 19:33:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 867 states have (on average 1.314878892733564) internal successors, (1140), 877 states have internal predecessors, (1140), 205 states have call successors, (205), 117 states have call predecessors, (205), 117 states have return successors, (205), 196 states have call predecessors, (205), 205 states have call successors, (205) [2021-11-25 19:33:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1550 transitions. [2021-11-25 19:33:59,618 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1550 transitions. Word has length 86 [2021-11-25 19:33:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:33:59,619 INFO L470 AbstractCegarLoop]: Abstraction has 1190 states and 1550 transitions. [2021-11-25 19:33:59,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-25 19:33:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1550 transitions. [2021-11-25 19:33:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-25 19:33:59,624 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:33:59,624 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:33:59,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-25 19:33:59,625 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:33:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:33:59,626 INFO L85 PathProgramCache]: Analyzing trace with hash 153649239, now seen corresponding path program 1 times [2021-11-25 19:33:59,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:33:59,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086759823] [2021-11-25 19:33:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:33:59,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:33:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:33:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-25 19:33:59,684 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:33:59,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086759823] [2021-11-25 19:33:59,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086759823] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:33:59,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93870764] [2021-11-25 19:33:59,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:33:59,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:33:59,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:33:59,686 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:33:59,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 19:33:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:33:59,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 19:33:59,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:33:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-25 19:33:59,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:33:59,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93870764] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:33:59,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:33:59,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-25 19:33:59,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023389144] [2021-11-25 19:33:59,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:33:59,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:33:59,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:33:59,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:33:59,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:33:59,991 INFO L87 Difference]: Start difference. First operand 1190 states and 1550 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-11-25 19:34:00,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:00,121 INFO L93 Difference]: Finished difference Result 2251 states and 2957 transitions. [2021-11-25 19:34:00,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:34:00,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 100 [2021-11-25 19:34:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:00,132 INFO L225 Difference]: With dead ends: 2251 [2021-11-25 19:34:00,132 INFO L226 Difference]: Without dead ends: 1459 [2021-11-25 19:34:00,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:34:00,136 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:00,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:34:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2021-11-25 19:34:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1295. [2021-11-25 19:34:00,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 954 states have (on average 1.3238993710691824) internal successors, (1263), 964 states have internal predecessors, (1263), 214 states have call successors, (214), 126 states have call predecessors, (214), 126 states have return successors, (214), 205 states have call predecessors, (214), 214 states have call successors, (214) [2021-11-25 19:34:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1691 transitions. [2021-11-25 19:34:00,253 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1691 transitions. Word has length 100 [2021-11-25 19:34:00,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:00,253 INFO L470 AbstractCegarLoop]: Abstraction has 1295 states and 1691 transitions. [2021-11-25 19:34:00,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-11-25 19:34:00,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1691 transitions. [2021-11-25 19:34:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-25 19:34:00,259 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:00,259 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:34:00,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 19:34:00,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-25 19:34:00,481 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:00,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1699567136, now seen corresponding path program 2 times [2021-11-25 19:34:00,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:00,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411709208] [2021-11-25 19:34:00,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:00,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-25 19:34:00,556 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:00,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411709208] [2021-11-25 19:34:00,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411709208] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:00,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123313858] [2021-11-25 19:34:00,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:34:00,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:00,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:00,561 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:34:00,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 19:34:00,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-25 19:34:00,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:34:00,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-25 19:34:00,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:34:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-25 19:34:01,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:34:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-25 19:34:01,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123313858] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:01,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-25 19:34:01,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 14 [2021-11-25 19:34:01,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058561701] [2021-11-25 19:34:01,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:34:01,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:34:01,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:01,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:34:01,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:34:01,468 INFO L87 Difference]: Start difference. First operand 1295 states and 1691 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-25 19:34:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:01,672 INFO L93 Difference]: Finished difference Result 2584 states and 3421 transitions. [2021-11-25 19:34:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:34:01,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 100 [2021-11-25 19:34:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:01,684 INFO L225 Difference]: With dead ends: 2584 [2021-11-25 19:34:01,684 INFO L226 Difference]: Without dead ends: 1687 [2021-11-25 19:34:01,688 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-25 19:34:01,689 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 89 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:01,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 219 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:34:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2021-11-25 19:34:01,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1623. [2021-11-25 19:34:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1246 states have (on average 1.3089887640449438) internal successors, (1631), 1256 states have internal predecessors, (1631), 220 states have call successors, (220), 156 states have call predecessors, (220), 156 states have return successors, (236), 211 states have call predecessors, (236), 220 states have call successors, (236) [2021-11-25 19:34:01,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2087 transitions. [2021-11-25 19:34:01,810 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2087 transitions. Word has length 100 [2021-11-25 19:34:01,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:01,810 INFO L470 AbstractCegarLoop]: Abstraction has 1623 states and 2087 transitions. [2021-11-25 19:34:01,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-25 19:34:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2087 transitions. [2021-11-25 19:34:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-25 19:34:01,825 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:01,826 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:34:01,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 19:34:02,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-25 19:34:02,049 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:02,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash 510483117, now seen corresponding path program 1 times [2021-11-25 19:34:02,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:02,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807657722] [2021-11-25 19:34:02,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:02,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-25 19:34:02,104 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:02,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807657722] [2021-11-25 19:34:02,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807657722] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:02,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916222890] [2021-11-25 19:34:02,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:02,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:02,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:02,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:34:02,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 19:34:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:02,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 19:34:02,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:34:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-25 19:34:02,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:34:02,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916222890] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:34:02,370 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:34:02,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-25 19:34:02,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476051179] [2021-11-25 19:34:02,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:34:02,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:34:02,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:02,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:34:02,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:34:02,373 INFO L87 Difference]: Start difference. First operand 1623 states and 2087 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-11-25 19:34:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:02,514 INFO L93 Difference]: Finished difference Result 3076 states and 4009 transitions. [2021-11-25 19:34:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:34:02,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 99 [2021-11-25 19:34:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:02,527 INFO L225 Difference]: With dead ends: 3076 [2021-11-25 19:34:02,527 INFO L226 Difference]: Without dead ends: 1953 [2021-11-25 19:34:02,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:34:02,531 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:02,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 218 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:34:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2021-11-25 19:34:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1760. [2021-11-25 19:34:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1359 states have (on average 1.3171449595290654) internal successors, (1790), 1369 states have internal predecessors, (1790), 232 states have call successors, (232), 168 states have call predecessors, (232), 168 states have return successors, (248), 223 states have call predecessors, (248), 232 states have call successors, (248) [2021-11-25 19:34:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2270 transitions. [2021-11-25 19:34:02,676 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2270 transitions. Word has length 99 [2021-11-25 19:34:02,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:02,677 INFO L470 AbstractCegarLoop]: Abstraction has 1760 states and 2270 transitions. [2021-11-25 19:34:02,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-11-25 19:34:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2270 transitions. [2021-11-25 19:34:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-25 19:34:02,682 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:02,682 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:34:02,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 19:34:02,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:02,897 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:02,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:02,897 INFO L85 PathProgramCache]: Analyzing trace with hash 350188677, now seen corresponding path program 2 times [2021-11-25 19:34:02,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:02,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416800883] [2021-11-25 19:34:02,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:02,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-25 19:34:02,959 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:02,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416800883] [2021-11-25 19:34:02,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416800883] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:02,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595658753] [2021-11-25 19:34:02,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 19:34:02,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:02,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:02,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:34:02,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 19:34:03,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 19:34:03,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 19:34:03,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:34:03,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:34:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-25 19:34:03,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:34:03,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595658753] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:34:03,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:34:03,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-25 19:34:03,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425407606] [2021-11-25 19:34:03,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:34:03,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:34:03,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:03,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:34:03,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:34:03,192 INFO L87 Difference]: Start difference. First operand 1760 states and 2270 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-11-25 19:34:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:03,352 INFO L93 Difference]: Finished difference Result 3028 states and 3998 transitions. [2021-11-25 19:34:03,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:34:03,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 99 [2021-11-25 19:34:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:03,365 INFO L225 Difference]: With dead ends: 3028 [2021-11-25 19:34:03,365 INFO L226 Difference]: Without dead ends: 1768 [2021-11-25 19:34:03,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:34:03,369 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 85 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:03,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 219 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:34:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2021-11-25 19:34:03,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1748. [2021-11-25 19:34:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1347 states have (on average 1.2798812175204157) internal successors, (1724), 1357 states have internal predecessors, (1724), 232 states have call successors, (232), 168 states have call predecessors, (232), 168 states have return successors, (248), 223 states have call predecessors, (248), 232 states have call successors, (248) [2021-11-25 19:34:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2204 transitions. [2021-11-25 19:34:03,485 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2204 transitions. Word has length 99 [2021-11-25 19:34:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:03,486 INFO L470 AbstractCegarLoop]: Abstraction has 1748 states and 2204 transitions. [2021-11-25 19:34:03,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-11-25 19:34:03,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2204 transitions. [2021-11-25 19:34:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-25 19:34:03,495 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:03,496 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:34:03,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 19:34:03,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 19:34:03,713 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:03,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:03,713 INFO L85 PathProgramCache]: Analyzing trace with hash -579169819, now seen corresponding path program 1 times [2021-11-25 19:34:03,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:03,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343935914] [2021-11-25 19:34:03,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:03,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:03,771 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-25 19:34:03,771 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:03,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343935914] [2021-11-25 19:34:03,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343935914] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:03,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60186983] [2021-11-25 19:34:03,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:03,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:03,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:03,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:34:03,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 19:34:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:03,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-25 19:34:03,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:34:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-25 19:34:04,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:34:04,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60186983] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:34:04,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:34:04,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-25 19:34:04,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575137199] [2021-11-25 19:34:04,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:34:04,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:34:04,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:04,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:34:04,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:34:04,005 INFO L87 Difference]: Start difference. First operand 1748 states and 2204 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-11-25 19:34:04,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:04,155 INFO L93 Difference]: Finished difference Result 3196 states and 4053 transitions. [2021-11-25 19:34:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:34:04,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 99 [2021-11-25 19:34:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:04,168 INFO L225 Difference]: With dead ends: 3196 [2021-11-25 19:34:04,169 INFO L226 Difference]: Without dead ends: 1997 [2021-11-25 19:34:04,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:34:04,174 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 84 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:04,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 112 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:34:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2021-11-25 19:34:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1997. [2021-11-25 19:34:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1566 states have (on average 1.248403575989783) internal successors, (1955), 1576 states have internal predecessors, (1955), 238 states have call successors, (238), 192 states have call predecessors, (238), 192 states have return successors, (254), 229 states have call predecessors, (254), 238 states have call successors, (254) [2021-11-25 19:34:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2447 transitions. [2021-11-25 19:34:04,298 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2447 transitions. Word has length 99 [2021-11-25 19:34:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:04,298 INFO L470 AbstractCegarLoop]: Abstraction has 1997 states and 2447 transitions. [2021-11-25 19:34:04,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-11-25 19:34:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2447 transitions. [2021-11-25 19:34:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-25 19:34:04,303 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:04,303 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:34:04,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 19:34:04,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:04,516 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:04,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:04,517 INFO L85 PathProgramCache]: Analyzing trace with hash -461371372, now seen corresponding path program 1 times [2021-11-25 19:34:04,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:04,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070794701] [2021-11-25 19:34:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:04,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-25 19:34:04,583 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:04,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070794701] [2021-11-25 19:34:04,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070794701] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:04,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688250685] [2021-11-25 19:34:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:04,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:04,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:04,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:34:04,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 19:34:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:04,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:34:04,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:34:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 19:34:04,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:34:04,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688250685] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:34:04,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:34:04,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-25 19:34:04,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223245139] [2021-11-25 19:34:04,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:34:04,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:34:04,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:04,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:34:04,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:34:04,833 INFO L87 Difference]: Start difference. First operand 1997 states and 2447 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-25 19:34:04,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:04,971 INFO L93 Difference]: Finished difference Result 3367 states and 4218 transitions. [2021-11-25 19:34:04,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:34:04,972 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), 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 99 [2021-11-25 19:34:04,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:04,984 INFO L225 Difference]: With dead ends: 3367 [2021-11-25 19:34:04,984 INFO L226 Difference]: Without dead ends: 1981 [2021-11-25 19:34:04,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:34:04,989 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 72 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:04,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 225 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:34:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2021-11-25 19:34:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1961. [2021-11-25 19:34:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1534 states have (on average 1.2118644067796611) internal successors, (1859), 1540 states have internal predecessors, (1859), 238 states have call successors, (238), 192 states have call predecessors, (238), 188 states have return successors, (250), 229 states have call predecessors, (250), 238 states have call successors, (250) [2021-11-25 19:34:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2347 transitions. [2021-11-25 19:34:05,115 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2347 transitions. Word has length 99 [2021-11-25 19:34:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:05,116 INFO L470 AbstractCegarLoop]: Abstraction has 1961 states and 2347 transitions. [2021-11-25 19:34:05,116 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), 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-11-25 19:34:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2347 transitions. [2021-11-25 19:34:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-25 19:34:05,121 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:05,121 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:34:05,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 19:34:05,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-25 19:34:05,334 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:05,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash 292411212, now seen corresponding path program 1 times [2021-11-25 19:34:05,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:05,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502946400] [2021-11-25 19:34:05,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:05,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-25 19:34:05,416 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:05,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502946400] [2021-11-25 19:34:05,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502946400] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:05,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60883426] [2021-11-25 19:34:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:05,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:05,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:05,418 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:34:05,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 19:34:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:05,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 19:34:05,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:34:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-25 19:34:05,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:34:05,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60883426] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:34:05,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:34:05,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-25 19:34:05,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974217844] [2021-11-25 19:34:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:34:05,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 19:34:05,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 19:34:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:34:05,651 INFO L87 Difference]: Start difference. First operand 1961 states and 2347 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-25 19:34:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:05,812 INFO L93 Difference]: Finished difference Result 4621 states and 5593 transitions. [2021-11-25 19:34:05,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 19:34:05,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 100 [2021-11-25 19:34:05,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:05,828 INFO L225 Difference]: With dead ends: 4621 [2021-11-25 19:34:05,829 INFO L226 Difference]: Without dead ends: 2666 [2021-11-25 19:34:05,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:34:05,835 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 40 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:05,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 185 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 19:34:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2021-11-25 19:34:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2149. [2021-11-25 19:34:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 1686 states have (on average 1.2188612099644127) internal successors, (2055), 1693 states have internal predecessors, (2055), 256 states have call successors, (256), 210 states have call predecessors, (256), 206 states have return successors, (268), 246 states have call predecessors, (268), 256 states have call successors, (268) [2021-11-25 19:34:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2579 transitions. [2021-11-25 19:34:06,023 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2579 transitions. Word has length 100 [2021-11-25 19:34:06,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:06,024 INFO L470 AbstractCegarLoop]: Abstraction has 2149 states and 2579 transitions. [2021-11-25 19:34:06,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-25 19:34:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2579 transitions. [2021-11-25 19:34:06,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-25 19:34:06,030 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:06,030 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:34:06,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 19:34:06,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-25 19:34:06,252 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:06,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:06,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1361042196, now seen corresponding path program 1 times [2021-11-25 19:34:06,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:06,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088764566] [2021-11-25 19:34:06,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:06,253 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-25 19:34:06,338 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:06,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088764566] [2021-11-25 19:34:06,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088764566] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:06,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242809172] [2021-11-25 19:34:06,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:06,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:06,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:06,340 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:34:06,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 19:34:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:06,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 19:34:06,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:34:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-25 19:34:06,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:34:06,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242809172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:34:06,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:34:06,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-11-25 19:34:06,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200367466] [2021-11-25 19:34:06,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:34:06,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:34:06,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:06,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:34:06,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:34:06,633 INFO L87 Difference]: Start difference. First operand 2149 states and 2579 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-25 19:34:06,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:06,915 INFO L93 Difference]: Finished difference Result 3835 states and 4646 transitions. [2021-11-25 19:34:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:34:06,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 101 [2021-11-25 19:34:06,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:06,934 INFO L225 Difference]: With dead ends: 3835 [2021-11-25 19:34:06,934 INFO L226 Difference]: Without dead ends: 2738 [2021-11-25 19:34:06,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:34:06,938 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 120 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:06,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 223 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:34:06,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2021-11-25 19:34:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2414. [2021-11-25 19:34:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 1916 states have (on average 1.2014613778705636) internal successors, (2302), 1929 states have internal predecessors, (2302), 268 states have call successors, (268), 229 states have call predecessors, (268), 229 states have return successors, (285), 256 states have call predecessors, (285), 268 states have call successors, (285) [2021-11-25 19:34:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 2855 transitions. [2021-11-25 19:34:07,117 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 2855 transitions. Word has length 101 [2021-11-25 19:34:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:07,117 INFO L470 AbstractCegarLoop]: Abstraction has 2414 states and 2855 transitions. [2021-11-25 19:34:07,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-25 19:34:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2855 transitions. [2021-11-25 19:34:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-25 19:34:07,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:07,123 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:34:07,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 19:34:07,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:07,348 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:07,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1962250413, now seen corresponding path program 1 times [2021-11-25 19:34:07,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:07,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044305939] [2021-11-25 19:34:07,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:07,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-25 19:34:07,407 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:07,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044305939] [2021-11-25 19:34:07,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044305939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:34:07,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:34:07,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-25 19:34:07,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75921189] [2021-11-25 19:34:07,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:34:07,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:34:07,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:07,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:34:07,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:34:07,410 INFO L87 Difference]: Start difference. First operand 2414 states and 2855 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-25 19:34:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:07,687 INFO L93 Difference]: Finished difference Result 3729 states and 4492 transitions. [2021-11-25 19:34:07,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 19:34:07,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2021-11-25 19:34:07,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:07,702 INFO L225 Difference]: With dead ends: 3729 [2021-11-25 19:34:07,702 INFO L226 Difference]: Without dead ends: 2414 [2021-11-25 19:34:07,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-25 19:34:07,707 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 169 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:07,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 242 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:34:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2021-11-25 19:34:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2405. [2021-11-25 19:34:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 1907 states have (on average 1.1793392763502883) internal successors, (2249), 1920 states have internal predecessors, (2249), 268 states have call successors, (268), 229 states have call predecessors, (268), 229 states have return successors, (285), 256 states have call predecessors, (285), 268 states have call successors, (285) [2021-11-25 19:34:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 2802 transitions. [2021-11-25 19:34:07,913 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 2802 transitions. Word has length 101 [2021-11-25 19:34:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:07,913 INFO L470 AbstractCegarLoop]: Abstraction has 2405 states and 2802 transitions. [2021-11-25 19:34:07,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-25 19:34:07,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 2802 transitions. [2021-11-25 19:34:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-25 19:34:07,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:07,922 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:34:07,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-25 19:34:07,922 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:07,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:07,923 INFO L85 PathProgramCache]: Analyzing trace with hash -149093846, now seen corresponding path program 1 times [2021-11-25 19:34:07,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:07,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824276060] [2021-11-25 19:34:07,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:07,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-25 19:34:07,997 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:07,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824276060] [2021-11-25 19:34:07,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824276060] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:34:07,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:34:07,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:34:07,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125785721] [2021-11-25 19:34:07,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:34:07,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:34:07,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:08,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:34:08,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:34:08,000 INFO L87 Difference]: Start difference. First operand 2405 states and 2802 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-25 19:34:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:08,364 INFO L93 Difference]: Finished difference Result 4587 states and 5361 transitions. [2021-11-25 19:34:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 19:34:08,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2021-11-25 19:34:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:08,384 INFO L225 Difference]: With dead ends: 4587 [2021-11-25 19:34:08,384 INFO L226 Difference]: Without dead ends: 3281 [2021-11-25 19:34:08,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:34:08,389 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 74 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:08,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 344 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:34:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2021-11-25 19:34:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3179. [2021-11-25 19:34:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 2494 states have (on average 1.165597433841219) internal successors, (2907), 2518 states have internal predecessors, (2907), 368 states have call successors, (368), 311 states have call predecessors, (368), 316 states have return successors, (419), 350 states have call predecessors, (419), 368 states have call successors, (419) [2021-11-25 19:34:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 3694 transitions. [2021-11-25 19:34:08,634 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 3694 transitions. Word has length 102 [2021-11-25 19:34:08,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:08,634 INFO L470 AbstractCegarLoop]: Abstraction has 3179 states and 3694 transitions. [2021-11-25 19:34:08,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-25 19:34:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 3694 transitions. [2021-11-25 19:34:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-25 19:34:08,641 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:08,641 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-25 19:34:08,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-25 19:34:08,642 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1848578586, now seen corresponding path program 1 times [2021-11-25 19:34:08,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:08,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710157399] [2021-11-25 19:34:08,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:08,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-25 19:34:08,698 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:08,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710157399] [2021-11-25 19:34:08,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710157399] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:08,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026927474] [2021-11-25 19:34:08,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:08,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:08,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:08,700 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:34:08,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-25 19:34:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:08,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-25 19:34:08,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:34:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 19:34:08,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:34:08,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026927474] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:34:08,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:34:08,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2021-11-25 19:34:08,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370777836] [2021-11-25 19:34:08,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:34:08,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:34:08,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:08,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:34:08,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:34:08,980 INFO L87 Difference]: Start difference. First operand 3179 states and 3694 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-25 19:34:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:09,476 INFO L93 Difference]: Finished difference Result 6281 states and 7325 transitions. [2021-11-25 19:34:09,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 19:34:09,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 102 [2021-11-25 19:34:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:09,500 INFO L225 Difference]: With dead ends: 6281 [2021-11-25 19:34:09,500 INFO L226 Difference]: Without dead ends: 4084 [2021-11-25 19:34:09,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-25 19:34:09,507 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 160 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:09,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 291 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:34:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4084 states. [2021-11-25 19:34:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4084 to 3834. [2021-11-25 19:34:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3834 states, 3002 states have (on average 1.1578947368421053) internal successors, (3476), 3029 states have internal predecessors, (3476), 452 states have call successors, (452), 377 states have call predecessors, (452), 379 states have return successors, (524), 428 states have call predecessors, (524), 452 states have call successors, (524) [2021-11-25 19:34:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 3834 states and 4452 transitions. [2021-11-25 19:34:09,815 INFO L78 Accepts]: Start accepts. Automaton has 3834 states and 4452 transitions. Word has length 102 [2021-11-25 19:34:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:09,815 INFO L470 AbstractCegarLoop]: Abstraction has 3834 states and 4452 transitions. [2021-11-25 19:34:09,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-25 19:34:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 4452 transitions. [2021-11-25 19:34:09,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-25 19:34:09,822 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:09,822 INFO L514 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:34:09,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-25 19:34:10,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-25 19:34:10,043 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1977234743, now seen corresponding path program 1 times [2021-11-25 19:34:10,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:10,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95648919] [2021-11-25 19:34:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:10,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-25 19:34:10,217 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:10,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95648919] [2021-11-25 19:34:10,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95648919] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:10,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019992675] [2021-11-25 19:34:10,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:10,218 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:10,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:10,219 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:34:10,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-25 19:34:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:10,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-25 19:34:10,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:34:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 19:34:10,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:34:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-25 19:34:10,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019992675] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:34:10,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2072183987] [2021-11-25 19:34:10,980 INFO L159 IcfgInterpreter]: Started Sifa with 62 locations of interest [2021-11-25 19:34:10,980 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 19:34:10,986 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 19:34:10,992 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 19:34:10,992 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 19:34:16,081 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 118 for LOIs [2021-11-25 19:34:17,915 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 148 for LOIs [2021-11-25 19:34:18,793 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 124 for LOIs [2021-11-25 19:34:18,832 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 32 for LOIs [2021-11-25 19:34:18,838 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 55 for LOIs [2021-11-25 19:34:19,010 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 50 for LOIs [2021-11-25 19:34:19,214 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 19:34:30,064 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '109860#(and (<= ~local~0 2147483647) (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (= ~t1_pc~0 0) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (<= 0 (+ ~local~0 2147483648)) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~m_pc~0 1) (<= 1 ~m_i~0) (= ~t2_i~0 1) (= 0 ~t2_pc~0) (not (= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 0)) (<= ~m_i~0 1) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (= |#NULL.base| 0))' at error location [2021-11-25 19:34:30,064 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 19:34:30,065 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:34:30,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 6] total 20 [2021-11-25 19:34:30,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165375182] [2021-11-25 19:34:30,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:34:30,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-25 19:34:30,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:30,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-25 19:34:30,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=3727, Unknown=0, NotChecked=0, Total=4160 [2021-11-25 19:34:30,068 INFO L87 Difference]: Start difference. First operand 3834 states and 4452 transitions. Second operand has 20 states, 16 states have (on average 7.875) internal successors, (126), 18 states have internal predecessors, (126), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2021-11-25 19:34:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:32,270 INFO L93 Difference]: Finished difference Result 7111 states and 8470 transitions. [2021-11-25 19:34:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-11-25 19:34:32,271 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 7.875) internal successors, (126), 18 states have internal predecessors, (126), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 108 [2021-11-25 19:34:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:32,299 INFO L225 Difference]: With dead ends: 7111 [2021-11-25 19:34:32,299 INFO L226 Difference]: Without dead ends: 3277 [2021-11-25 19:34:32,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 289 SyntacticMatches, 13 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5791 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1121, Invalid=12219, Unknown=0, NotChecked=0, Total=13340 [2021-11-25 19:34:32,312 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 766 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:32,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 2106 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-25 19:34:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2021-11-25 19:34:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 2395. [2021-11-25 19:34:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 1902 states have (on average 1.1635120925341746) internal successors, (2213), 1916 states have internal predecessors, (2213), 258 states have call successors, (258), 234 states have call predecessors, (258), 234 states have return successors, (286), 244 states have call predecessors, (286), 258 states have call successors, (286) [2021-11-25 19:34:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 2757 transitions. [2021-11-25 19:34:32,522 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 2757 transitions. Word has length 108 [2021-11-25 19:34:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:32,522 INFO L470 AbstractCegarLoop]: Abstraction has 2395 states and 2757 transitions. [2021-11-25 19:34:32,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 7.875) internal successors, (126), 18 states have internal predecessors, (126), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2021-11-25 19:34:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2757 transitions. [2021-11-25 19:34:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-11-25 19:34:32,527 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:32,527 INFO L514 BasicCegarLoop]: trace histogram [5, 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, 1] [2021-11-25 19:34:32,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-25 19:34:32,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-25 19:34:32,748 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1012204749, now seen corresponding path program 1 times [2021-11-25 19:34:32,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:32,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584679971] [2021-11-25 19:34:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:32,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-25 19:34:32,893 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:32,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584679971] [2021-11-25 19:34:32,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584679971] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:32,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865356772] [2021-11-25 19:34:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:32,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:32,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:32,895 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:34:32,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-25 19:34:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:32,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-25 19:34:32,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:34:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 19:34:33,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:34:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-25 19:34:33,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865356772] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:34:33,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1054853782] [2021-11-25 19:34:33,564 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2021-11-25 19:34:33,564 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 19:34:33,565 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 19:34:33,565 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 19:34:33,565 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 19:34:37,023 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 119 for LOIs [2021-11-25 19:34:38,562 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 149 for LOIs [2021-11-25 19:34:39,222 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 125 for LOIs [2021-11-25 19:34:39,293 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 52 for LOIs [2021-11-25 19:34:39,308 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 54 for LOIs [2021-11-25 19:34:39,373 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 33 for LOIs [2021-11-25 19:34:39,564 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 19:34:50,336 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '124019#(and (<= ~t1_pc~0 1) (<= ~local~0 2147483647) (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (<= 0 (+ ~local~0 2147483648)) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (<= |#NULL.offset| 0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~m_pc~0 1) (<= 1 ~m_i~0) (= ~t2_i~0 1) (= 0 ~t2_pc~0) (not (= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 0)) (<= ~m_i~0 1) (= ~m_st~0 1) (<= ~token~0 2147483647) (<= 0 |#NULL.offset|) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2021-11-25 19:34:50,336 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 19:34:50,336 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:34:50,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 21 [2021-11-25 19:34:50,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951121310] [2021-11-25 19:34:50,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:34:50,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-25 19:34:50,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:34:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-25 19:34:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=4427, Unknown=0, NotChecked=0, Total=4830 [2021-11-25 19:34:50,340 INFO L87 Difference]: Start difference. First operand 2395 states and 2757 transitions. Second operand has 21 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2021-11-25 19:34:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:34:53,562 INFO L93 Difference]: Finished difference Result 4801 states and 5742 transitions. [2021-11-25 19:34:53,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-11-25 19:34:53,563 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 111 [2021-11-25 19:34:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:34:53,572 INFO L225 Difference]: With dead ends: 4801 [2021-11-25 19:34:53,572 INFO L226 Difference]: Without dead ends: 2556 [2021-11-25 19:34:53,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 301 SyntacticMatches, 18 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10966 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1644, Invalid=22848, Unknown=0, NotChecked=0, Total=24492 [2021-11-25 19:34:53,587 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 735 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-11-25 19:34:53,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [743 Valid, 2138 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2405 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-11-25 19:34:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2021-11-25 19:34:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1715. [2021-11-25 19:34:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1366 states have (on average 1.1544655929721817) internal successors, (1577), 1375 states have internal predecessors, (1577), 180 states have call successors, (180), 168 states have call predecessors, (180), 168 states have return successors, (202), 171 states have call predecessors, (202), 180 states have call successors, (202) [2021-11-25 19:34:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 1959 transitions. [2021-11-25 19:34:53,753 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 1959 transitions. Word has length 111 [2021-11-25 19:34:53,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:34:53,755 INFO L470 AbstractCegarLoop]: Abstraction has 1715 states and 1959 transitions. [2021-11-25 19:34:53,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2021-11-25 19:34:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 1959 transitions. [2021-11-25 19:34:53,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-25 19:34:53,759 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:34:53,759 INFO L514 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1] [2021-11-25 19:34:53,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-25 19:34:53,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:53,985 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:34:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:34:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1801256207, now seen corresponding path program 1 times [2021-11-25 19:34:53,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:34:53,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928271480] [2021-11-25 19:34:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:53,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:34:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-25 19:34:54,247 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:34:54,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928271480] [2021-11-25 19:34:54,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928271480] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:34:54,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459100445] [2021-11-25 19:34:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:34:54,248 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:34:54,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:34:54,253 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:34:54,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-25 19:34:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:34:54,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-25 19:34:54,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:34:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-25 19:34:54,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 19:34:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-25 19:34:55,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459100445] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 19:34:55,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [721774900] [2021-11-25 19:34:55,659 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2021-11-25 19:34:55,663 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 19:34:55,664 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 19:34:55,664 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 19:34:55,664 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 19:34:59,161 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 120 for LOIs [2021-11-25 19:35:01,180 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 150 for LOIs [2021-11-25 19:35:02,043 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 126 for LOIs [2021-11-25 19:35:02,072 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 34 for LOIs [2021-11-25 19:35:02,079 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 53 for LOIs [2021-11-25 19:35:02,144 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 34 for LOIs [2021-11-25 19:35:02,343 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 19:35:15,027 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '134034#(and (<= ~t1_pc~0 1) (<= ~local~0 2147483647) (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (<= 0 (+ ~local~0 2147483648)) (<= 0 ~t2_pc~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~m_pc~0 1) (<= ~t2_pc~0 1) (<= 1 ~m_i~0) (= ~t2_i~0 1) (not (= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 0)) (<= ~m_i~0 1) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2021-11-25 19:35:15,028 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 19:35:15,028 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 19:35:15,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 36 [2021-11-25 19:35:15,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736834907] [2021-11-25 19:35:15,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 19:35:15,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-25 19:35:15,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:35:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-25 19:35:15,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=7223, Unknown=0, NotChecked=0, Total=7832 [2021-11-25 19:35:15,032 INFO L87 Difference]: Start difference. First operand 1715 states and 1959 transitions. Second operand has 36 states, 24 states have (on average 6.916666666666667) internal successors, (166), 27 states have internal predecessors, (166), 14 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) [2021-11-25 19:35:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:19,031 INFO L93 Difference]: Finished difference Result 4280 states and 5037 transitions. [2021-11-25 19:35:19,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-25 19:35:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 24 states have (on average 6.916666666666667) internal successors, (166), 27 states have internal predecessors, (166), 14 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) Word has length 113 [2021-11-25 19:35:19,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:19,039 INFO L225 Difference]: With dead ends: 4280 [2021-11-25 19:35:19,040 INFO L226 Difference]: Without dead ends: 2872 [2021-11-25 19:35:19,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 278 SyntacticMatches, 4 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6404 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=1738, Invalid=15292, Unknown=0, NotChecked=0, Total=17030 [2021-11-25 19:35:19,050 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 3340 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 1776 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3340 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 4196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1776 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-11-25 19:35:19,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3340 Valid, 1128 Invalid, 4196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1776 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-11-25 19:35:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2021-11-25 19:35:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 1537. [2021-11-25 19:35:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1214 states have (on average 1.1523887973640856) internal successors, (1399), 1224 states have internal predecessors, (1399), 169 states have call successors, (169), 153 states have call predecessors, (169), 153 states have return successors, (169), 159 states have call predecessors, (169), 169 states have call successors, (169) [2021-11-25 19:35:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 1737 transitions. [2021-11-25 19:35:19,250 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 1737 transitions. Word has length 113 [2021-11-25 19:35:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:19,251 INFO L470 AbstractCegarLoop]: Abstraction has 1537 states and 1737 transitions. [2021-11-25 19:35:19,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 24 states have (on average 6.916666666666667) internal successors, (166), 27 states have internal predecessors, (166), 14 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) [2021-11-25 19:35:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1737 transitions. [2021-11-25 19:35:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-25 19:35:19,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:19,255 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:35:19,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:19,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:35:19,471 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:35:19,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash 634959828, now seen corresponding path program 1 times [2021-11-25 19:35:19,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:35:19,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373583409] [2021-11-25 19:35:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:19,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:35:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-25 19:35:19,559 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:35:19,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373583409] [2021-11-25 19:35:19,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373583409] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:19,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 19:35:19,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 19:35:19,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971978067] [2021-11-25 19:35:19,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:19,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 19:35:19,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:35:19,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 19:35:19,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:35:19,562 INFO L87 Difference]: Start difference. First operand 1537 states and 1737 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-25 19:35:20,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:20,211 INFO L93 Difference]: Finished difference Result 3939 states and 4488 transitions. [2021-11-25 19:35:20,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:35:20,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 126 [2021-11-25 19:35:20,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:20,223 INFO L225 Difference]: With dead ends: 3939 [2021-11-25 19:35:20,223 INFO L226 Difference]: Without dead ends: 3227 [2021-11-25 19:35:20,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-25 19:35:20,228 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 230 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 19:35:20,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 554 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 19:35:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2021-11-25 19:35:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2272. [2021-11-25 19:35:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 1777 states have (on average 1.152504220596511) internal successors, (2048), 1792 states have internal predecessors, (2048), 264 states have call successors, (264), 230 states have call predecessors, (264), 230 states have return successors, (264), 249 states have call predecessors, (264), 264 states have call successors, (264) [2021-11-25 19:35:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2576 transitions. [2021-11-25 19:35:20,445 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2576 transitions. Word has length 126 [2021-11-25 19:35:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:20,446 INFO L470 AbstractCegarLoop]: Abstraction has 2272 states and 2576 transitions. [2021-11-25 19:35:20,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-11-25 19:35:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2576 transitions. [2021-11-25 19:35:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-25 19:35:20,451 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:20,452 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-25 19:35:20,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-25 19:35:20,452 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:35:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:20,453 INFO L85 PathProgramCache]: Analyzing trace with hash 798613505, now seen corresponding path program 1 times [2021-11-25 19:35:20,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:35:20,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136943149] [2021-11-25 19:35:20,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:20,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:35:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 66 proven. 32 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-11-25 19:35:20,531 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:35:20,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136943149] [2021-11-25 19:35:20,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136943149] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:35:20,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126377788] [2021-11-25 19:35:20,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:20,532 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:35:20,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:35:20,537 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:35:20,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-25 19:35:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:20,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:35:20,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-25 19:35:20,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:20,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126377788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:20,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:35:20,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2021-11-25 19:35:20,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691297248] [2021-11-25 19:35:20,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:20,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:35:20,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:35:20,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:35:20,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:35:20,973 INFO L87 Difference]: Start difference. First operand 2272 states and 2576 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-25 19:35:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:21,337 INFO L93 Difference]: Finished difference Result 4334 states and 4895 transitions. [2021-11-25 19:35:21,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:35:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 157 [2021-11-25 19:35:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:21,345 INFO L225 Difference]: With dead ends: 4334 [2021-11-25 19:35:21,346 INFO L226 Difference]: Without dead ends: 2401 [2021-11-25 19:35:21,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:35:21,352 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 68 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:35:21,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 381 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:35:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2021-11-25 19:35:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2346. [2021-11-25 19:35:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 1829 states have (on average 1.1219245489338436) internal successors, (2052), 1845 states have internal predecessors, (2052), 277 states have call successors, (277), 239 states have call predecessors, (277), 239 states have return successors, (277), 261 states have call predecessors, (277), 277 states have call successors, (277) [2021-11-25 19:35:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 2606 transitions. [2021-11-25 19:35:21,656 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 2606 transitions. Word has length 157 [2021-11-25 19:35:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:21,656 INFO L470 AbstractCegarLoop]: Abstraction has 2346 states and 2606 transitions. [2021-11-25 19:35:21,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-11-25 19:35:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 2606 transitions. [2021-11-25 19:35:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-25 19:35:21,663 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:21,663 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:35:21,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:21,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:35:21,889 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:35:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1388921939, now seen corresponding path program 1 times [2021-11-25 19:35:21,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:35:21,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809928899] [2021-11-25 19:35:21,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:21,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:35:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 87 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-11-25 19:35:21,974 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:35:21,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809928899] [2021-11-25 19:35:21,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809928899] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:35:21,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863894008] [2021-11-25 19:35:21,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:21,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:35:21,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:35:21,976 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:35:21,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-25 19:35:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:22,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 19:35:22,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-25 19:35:22,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:22,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863894008] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:22,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:35:22,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2021-11-25 19:35:22,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291775487] [2021-11-25 19:35:22,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:22,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-25 19:35:22,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:35:22,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-25 19:35:22,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-25 19:35:22,431 INFO L87 Difference]: Start difference. First operand 2346 states and 2606 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-25 19:35:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:22,696 INFO L93 Difference]: Finished difference Result 3364 states and 3713 transitions. [2021-11-25 19:35:22,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 19:35:22,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 158 [2021-11-25 19:35:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:22,701 INFO L225 Difference]: With dead ends: 3364 [2021-11-25 19:35:22,701 INFO L226 Difference]: Without dead ends: 1406 [2021-11-25 19:35:22,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-25 19:35:22,705 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 53 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:35:22,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 328 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:35:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2021-11-25 19:35:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1342. [2021-11-25 19:35:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1052 states have (on average 1.1036121673003803) internal successors, (1161), 1062 states have internal predecessors, (1161), 154 states have call successors, (154), 135 states have call predecessors, (154), 135 states have return successors, (154), 144 states have call predecessors, (154), 154 states have call successors, (154) [2021-11-25 19:35:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1469 transitions. [2021-11-25 19:35:22,834 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1469 transitions. Word has length 158 [2021-11-25 19:35:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:22,835 INFO L470 AbstractCegarLoop]: Abstraction has 1342 states and 1469 transitions. [2021-11-25 19:35:22,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2021-11-25 19:35:22,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1469 transitions. [2021-11-25 19:35:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-25 19:35:22,839 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 19:35:22,839 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-11-25 19:35:22,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:23,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:35:23,053 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 19:35:23,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 19:35:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash 636932029, now seen corresponding path program 1 times [2021-11-25 19:35:23,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 19:35:23,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892609628] [2021-11-25 19:35:23,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:23,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 19:35:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-11-25 19:35:23,133 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 19:35:23,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892609628] [2021-11-25 19:35:23,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892609628] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 19:35:23,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990910222] [2021-11-25 19:35:23,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 19:35:23,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 19:35:23,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 19:35:23,135 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 19:35:23,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-25 19:35:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 19:35:23,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-25 19:35:23,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 19:35:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-25 19:35:23,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-25 19:35:23,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990910222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 19:35:23,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-25 19:35:23,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2021-11-25 19:35:23,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924205967] [2021-11-25 19:35:23,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 19:35:23,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 19:35:23,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 19:35:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 19:35:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-25 19:35:23,506 INFO L87 Difference]: Start difference. First operand 1342 states and 1469 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2021-11-25 19:35:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 19:35:23,756 INFO L93 Difference]: Finished difference Result 1876 states and 2055 transitions. [2021-11-25 19:35:23,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 19:35:23,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 159 [2021-11-25 19:35:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 19:35:23,757 INFO L225 Difference]: With dead ends: 1876 [2021-11-25 19:35:23,757 INFO L226 Difference]: Without dead ends: 0 [2021-11-25 19:35:23,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-25 19:35:23,761 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 166 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 19:35:23,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 249 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 19:35:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-25 19:35:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-25 19:35:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 19:35:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-25 19:35:23,763 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2021-11-25 19:35:23,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 19:35:23,764 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-25 19:35:23,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2021-11-25 19:35:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-25 19:35:23,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-25 19:35:23,767 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-25 19:35:23,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-25 19:35:23,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-25 19:35:23,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-25 19:35:39,130 WARN L227 SmtUtils]: Spent 11.53s on a formula simplification. DAG size of input: 430 DAG size of output: 400 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-25 19:36:11,232 WARN L227 SmtUtils]: Spent 10.35s on a formula simplification. DAG size of input: 430 DAG size of output: 400 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-25 19:36:37,669 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 210) no Hoare annotation was computed. [2021-11-25 19:36:37,669 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 194) no Hoare annotation was computed. [2021-11-25 19:36:37,670 INFO L858 garLoopResultBuilder]: For program point L185-2(lines 185 194) no Hoare annotation was computed. [2021-11-25 19:36:37,670 INFO L854 garLoopResultBuilder]: At program point L177(lines 165 179) the Hoare annotation is: (let ((.cse31 (= ~E_2~0 1))) (let ((.cse7 (not (= ~E_M~0 ~E_1~0))) (.cse47 (not (= ~E_1~0 1))) (.cse41 (= ~t1_pc~0 1)) (.cse6 (not .cse31)) (.cse45 (= ~t2_pc~0 1)) (.cse42 (<= 2 ~E_1~0)) (.cse38 (= ~t1_st~0 0)) (.cse25 (= 0 ~t2_st~0)) (.cse19 (= |old(~m_st~0)| 0)) (.cse48 (+ ~local~0 1)) (.cse43 (= ~t1_i~0 1)) (.cse39 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse44 (<= 1 ~m_pc~0)) (.cse37 (= |old(~t2_st~0)| ~t2_st~0)) (.cse46 (= ~t2_i~0 1))) (let ((.cse10 (and .cse43 .cse39 .cse22 .cse23 .cse44 .cse37 .cse46)) (.cse8 (not (<= .cse48 ~token~0))) (.cse13 (not (<= ~token~0 .cse48))) (.cse24 (= 2 ~t1_st~0)) (.cse32 (not .cse19)) (.cse35 (not (= |old(~t1_st~0)| 0))) (.cse20 (not (= |old(~t2_st~0)| 0))) (.cse36 (not (= ~t1_pc~0 0))) (.cse26 (not (<= ~t2_pc~0 0))) (.cse40 (and .cse22 .cse23 .cse38 .cse25)) (.cse21 (not (<= ~m_pc~0 0))) (.cse30 (not (< .cse48 ~token~0))) (.cse33 (not .cse42)) (.cse34 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse4 (not (= ~E_1~0 2))) (.cse11 (not (= 2 |old(~m_st~0)|))) (.cse16 (and .cse41 .cse42 .cse43 .cse39 .cse22 .cse23 .cse44 .cse6 .cse37 .cse45 .cse46)) (.cse14 (not (= ~E_2~0 2))) (.cse0 (not .cse46)) (.cse18 (not (= ~E_M~0 2))) (.cse1 (not (= ~m_i~0 1))) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (not .cse41)) (.cse5 (not .cse43)) (.cse27 (and .cse47 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse9 (not .cse44)) (.cse15 (not (= |old(~t1_st~0)| 2))) (.cse12 (not .cse45)) (.cse17 (not (= 2 |old(~t2_st~0)|))) (.cse28 (and .cse7 .cse47)) (.cse29 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse15 .cse11 .cse16 .cse12 .cse17 .cse13) (or .cse14 .cse0 .cse18 .cse19 .cse1 .cse20 .cse3 .cse21 (and .cse22 .cse23 .cse24 .cse25) .cse5 .cse26 .cse27 .cse15 .cse28 .cse29) (or .cse30 .cse14 .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse32 .cse15 .cse10 .cse12 .cse17 .cse33 .cse34) (or .cse35 .cse14 .cse0 .cse18 .cse19 .cse1 .cse21 .cse5 .cse36 (and .cse22 .cse23 .cse37 .cse38) .cse27 .cse12 .cse17 .cse28 .cse29) (or .cse0 .cse18 .cse1 .cse20 .cse2 .cse3 .cse5 .cse6 .cse26 .cse7 (and .cse39 .cse22 .cse23 .cse25) .cse8 .cse11 .cse13) (or .cse14 .cse0 .cse1 .cse3 .cse21 (and .cse22 .cse23 .cse24 .cse37) .cse4 .cse5 .cse7 .cse15 .cse12 .cse17) (or .cse35 .cse14 .cse0 .cse1 .cse20 .cse21 .cse4 .cse5 .cse36 .cse26 .cse7 .cse40 .cse32 .cse29) (or .cse35 .cse14 .cse0 .cse18 .cse19 .cse1 .cse20 .cse21 .cse5 .cse36 .cse26 .cse40 .cse27 .cse28 .cse29) (or .cse14 .cse0 .cse18 .cse19 .cse1 .cse3 .cse21 .cse5 .cse15 .cse12 (and .cse39 .cse22 .cse23 .cse37) .cse17 .cse28 .cse29) (or .cse30 .cse14 .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse15 .cse12 (and .cse41 (= |activate_threads_is_master_triggered_~__retres1~0#1| 1) .cse42 .cse43 .cse39 .cse22 .cse44 .cse6 .cse37 .cse45 .cse46) .cse33 .cse34 (not (= ~E_M~0 1))) (or .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse11 .cse16 .cse12 .cse17 .cse29) (or .cse14 .cse0 .cse18 .cse19 .cse31 .cse1 .cse2 .cse3 .cse5 .cse27 (and .cse43 .cse39 .cse22 .cse23 .cse44 .cse6 .cse37 .cse46) .cse9 .cse15 .cse12 .cse17 .cse28 .cse29))))) [2021-11-25 19:36:37,671 INFO L858 garLoopResultBuilder]: For program point L186(lines 186 191) no Hoare annotation was computed. [2021-11-25 19:36:37,671 INFO L854 garLoopResultBuilder]: At program point L215(lines 203 217) the Hoare annotation is: (let ((.cse10 (not (= ~E_M~0 ~E_1~0))) (.cse44 (= ~t2_i~0 1)) (.cse46 (not (= ~E_1~0 1))) (.cse20 (= |old(~m_st~0)| 0)) (.cse42 (= ~t1_i~0 1)) (.cse34 (= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (= ~t1_st~0 0)) (.cse43 (<= ~m_pc~0 0)) (.cse37 (= 0 ~t2_st~0)) (.cse47 (<= ~t2_pc~0 0)) (.cse4 (= ~E_2~0 1)) (.cse48 (+ ~local~0 1)) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse36 (= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse40 (= 2 ~t1_st~0)) (.cse41 (= |old(~t2_st~0)| ~t2_st~0)) (.cse38 (= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse39 (= |activate_threads_is_transmit2_triggered_~__retres1~2#1| 0))) (let ((.cse3 (and .cse35 .cse36 .cse40 .cse41 .cse38 .cse39)) (.cse0 (not (< .cse48 ~token~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse17 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse33 (not .cse4)) (.cse30 (not (<= .cse48 ~token~0))) (.cse32 (not (<= ~token~0 .cse48))) (.cse29 (and .cse35 .cse36 .cse41 .cse39)) (.cse21 (and .cse42 .cse34 .cse35 .cse36 .cse45 .cse43 .cse37 .cse38 .cse39 .cse47)) (.cse22 (not (= |old(~t2_st~0)| 0))) (.cse25 (not .cse47)) (.cse12 (not .cse20)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse24 (not (= ~t1_pc~0 0))) (.cse26 (and .cse46 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse6 (not (= ~m_pc~0 1))) (.cse8 (not (= ~E_1~0 2))) (.cse11 (not (<= 1 ~m_pc~0))) (.cse31 (not (= 2 |old(~m_st~0)|))) (.cse1 (not (= ~E_2~0 2))) (.cse2 (not .cse44)) (.cse19 (not (= ~E_M~0 2))) (.cse5 (not (= ~m_i~0 1))) (.cse7 (not (= ~t1_pc~0 1))) (.cse23 (not .cse43)) (.cse9 (not .cse42)) (.cse13 (not (= |old(~t1_st~0)| 2))) (.cse14 (not (= ~t2_pc~0 1))) (.cse15 (not (= 2 |old(~t2_st~0)|))) (.cse27 (and .cse10 .cse46)) (.cse28 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse1 .cse2 .cse19 .cse20 .cse21 .cse5 .cse22 .cse23 .cse9 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse1 .cse2 .cse19 .cse20 .cse5 .cse22 .cse7 .cse23 .cse9 .cse25 .cse26 .cse13 .cse29 .cse27 .cse28) (or .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse30 .cse11 .cse13 .cse31 .cse14 .cse15 .cse32) (or .cse2 .cse19 .cse5 .cse22 .cse6 .cse7 .cse9 .cse33 .cse25 .cse10 .cse30 .cse31 (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) .cse32) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 (and (= |activate_threads_is_master_triggered_~__retres1~0#1| 1) (= ~m_st~0 0) .cse40 .cse41 .cse38 .cse39) .cse8 .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 (not (= ~E_M~0 1))) (or .cse1 (and .cse42 .cse35 .cse36 .cse40 .cse41 .cse43 .cse44 .cse38 .cse39) .cse2 .cse4 .cse5 .cse7 .cse23 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15) (or .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse33 .cse10 .cse30 .cse11 (and .cse34 .cse35 .cse36 .cse41 (= |activate_threads_is_transmit2_triggered_~__retres1~2#1| 1) .cse38) .cse31 .cse14 .cse32) (or .cse1 .cse2 .cse19 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse26 .cse11 .cse13 .cse29 .cse14 .cse15 .cse27 .cse28) (or .cse18 .cse1 .cse2 .cse21 .cse5 .cse22 .cse23 .cse8 .cse9 .cse24 .cse25 .cse10 .cse12 .cse28) (or .cse18 .cse1 .cse2 (and .cse35 .cse36 .cse41 .cse45 .cse38 .cse39) .cse19 .cse20 .cse5 .cse23 .cse9 .cse24 .cse26 .cse14 .cse15 .cse27 .cse28) (or .cse1 .cse2 .cse5 (and .cse34 .cse35 .cse36 .cse41 .cse38 .cse39) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse31 .cse14 .cse15 .cse28) (or .cse1 .cse2 (and .cse42 .cse35 .cse36 .cse41 .cse43 .cse44 .cse39) .cse19 .cse20 .cse4 .cse5 .cse7 .cse23 .cse9 .cse13 .cse14 .cse15 .cse27 .cse28)))) [2021-11-25 19:36:37,672 INFO L858 garLoopResultBuilder]: For program point L166(lines 166 175) no Hoare annotation was computed. [2021-11-25 19:36:37,672 INFO L858 garLoopResultBuilder]: For program point L166-2(lines 166 175) no Hoare annotation was computed. [2021-11-25 19:36:37,673 INFO L854 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 416 449) the Hoare annotation is: (let ((.cse18 (= ~E_2~0 1))) (let ((.cse32 (not (= ~E_M~0 ~E_1~0))) (.cse44 (<= ~m_pc~0 0)) (.cse4 (= |old(~m_st~0)| 0)) (.cse46 (= ~t1_pc~0 1)) (.cse47 (<= 2 ~E_1~0)) (.cse45 (= ~t2_pc~0 1)) (.cse43 (not (= ~E_1~0 1))) (.cse9 (= ~t1_st~0 0)) (.cse41 (= 0 ~t2_st~0)) (.cse48 (+ ~local~0 1)) (.cse27 (= ~t1_i~0 1)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse29 (<= 1 ~m_pc~0)) (.cse31 (not .cse18)) (.cse8 (= |old(~t2_st~0)| ~t2_st~0)) (.cse30 (= ~t2_i~0 1))) (let ((.cse24 (and .cse27 .cse28 .cse7 .cse29 .cse31 .cse8 .cse30)) (.cse33 (not (<= .cse48 ~token~0))) (.cse35 (not (<= ~token~0 .cse48))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse37 (not (= |old(~t2_st~0)| 0))) (.cse38 (and .cse7 .cse9 .cse41)) (.cse11 (not (= ~t1_pc~0 0))) (.cse39 (not (<= ~t2_pc~0 0))) (.cse12 (and .cse43 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse34 (not (= 2 |old(~m_st~0)|))) (.cse17 (not (< .cse48 ~token~0))) (.cse19 (not (= ~m_pc~0 1))) (.cse21 (not (= ~E_1~0 2))) (.cse42 (and .cse46 .cse47 .cse27 .cse28 .cse7 .cse29 .cse8 .cse45 .cse30)) (.cse22 (not .cse29)) (.cse40 (not .cse4)) (.cse25 (not .cse47)) (.cse26 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse1 (not (= ~E_2~0 2))) (.cse2 (not .cse30)) (.cse3 (not (= ~E_M~0 2))) (.cse5 (not (= ~m_i~0 1))) (.cse20 (not .cse46)) (.cse6 (not .cse44)) (.cse10 (not .cse27)) (.cse23 (not (= |old(~t1_st~0)| 2))) (.cse13 (not .cse45)) (.cse36 (and .cse27 .cse28 .cse7 .cse8 .cse44 .cse30)) (.cse14 (not (= 2 |old(~t2_st~0)|))) (.cse15 (and .cse32 .cse43)) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse1 .cse2 .cse18 .cse5 .cse19 .cse20 .cse21 .cse10 .cse22 .cse23 .cse24 .cse13 .cse25 .cse26 (not (= ~E_M~0 1))) (or (and .cse27 .cse28 .cse7 .cse29 .cse8 .cse30) .cse2 .cse5 .cse19 .cse20 .cse21 .cse10 .cse31 .cse32 .cse33 .cse22 .cse34 .cse13 .cse35) (or .cse1 .cse2 .cse5 .cse20 .cse6 .cse21 .cse10 .cse32 .cse23 .cse13 .cse36 .cse14) (or .cse0 .cse1 .cse2 .cse5 .cse37 .cse38 .cse6 .cse21 .cse10 .cse11 .cse39 .cse32 .cse40 .cse16) (or .cse2 (and .cse28 .cse7 .cse8) .cse3 .cse5 .cse37 .cse19 .cse20 .cse10 .cse31 .cse39 .cse32 .cse33 .cse34 .cse35) (or .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse19 .cse20 .cse10 .cse12 .cse22 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 (and .cse7 (= 2 ~t1_st~0) .cse41) .cse3 .cse4 .cse5 .cse37 .cse20 .cse6 .cse10 .cse39 .cse12 .cse23 .cse15 .cse16) (or .cse1 .cse2 .cse5 .cse19 .cse20 .cse21 .cse10 .cse32 .cse42 .cse33 .cse22 .cse23 .cse34 .cse13 .cse14 .cse35) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse37 .cse38 .cse6 .cse10 .cse11 .cse39 .cse12 .cse15 .cse16) (or .cse1 .cse2 .cse5 .cse19 .cse20 .cse21 .cse10 .cse32 .cse42 .cse22 .cse34 .cse13 .cse14 .cse16) (or .cse17 .cse1 .cse2 .cse18 .cse5 .cse19 .cse20 .cse21 .cse10 .cse32 .cse42 .cse22 .cse40 .cse23 .cse13 .cse14 .cse25 .cse26) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse10 .cse23 .cse13 .cse36 .cse14 .cse15 .cse16))))) [2021-11-25 19:36:37,673 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 213) no Hoare annotation was computed. [2021-11-25 19:36:37,673 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 416 449) no Hoare annotation was computed. [2021-11-25 19:36:37,673 INFO L858 garLoopResultBuilder]: For program point L204-2(lines 204 213) no Hoare annotation was computed. [2021-11-25 19:36:37,673 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2021-11-25 19:36:37,674 INFO L854 garLoopResultBuilder]: At program point L196(lines 184 198) the Hoare annotation is: (let ((.cse25 (= ~E_2~0 1))) (let ((.cse11 (not (= ~E_M~0 ~E_1~0))) (.cse46 (not (= ~E_1~0 1))) (.cse40 (not .cse25)) (.cse39 (<= 1 ~m_pc~0)) (.cse19 (= |old(~t2_st~0)| ~t2_st~0)) (.cse41 (= ~t2_i~0 1)) (.cse44 (+ ~local~0 1)) (.cse38 (= ~t1_i~0 1)) (.cse36 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (= ~m_st~0 |old(~m_st~0)|)) (.cse18 (= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse31 (= ~t1_st~0 0)) (.cse47 (<= ~m_pc~0 0)) (.cse37 (= 0 ~t2_st~0)) (.cse32 (= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse45 (<= ~t2_pc~0 0)) (.cse15 (= |old(~m_st~0)| 0))) (let ((.cse12 (not .cse15)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse3 (and .cse38 .cse36 .cse17 .cse18 .cse31 .cse47 .cse37 .cse32 .cse45)) (.cse9 (not (= ~t1_pc~0 0))) (.cse6 (not .cse47)) (.cse24 (not (< .cse44 ~token~0))) (.cse29 (not (<= 2 ~E_1~0))) (.cse30 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse28 (and .cse38 .cse36 .cse17 .cse18 .cse39 .cse19 .cse41 .cse32)) (.cse7 (not (= ~E_1~0 2))) (.cse35 (and .cse38 .cse36 .cse17 .cse18 .cse39 .cse40 .cse19 .cse41 .cse32)) (.cse1 (not (= ~E_2~0 2))) (.cse33 (and .cse46 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse27 (not .cse39)) (.cse20 (not (= |old(~t1_st~0)| 2))) (.cse21 (not (= ~t2_pc~0 1))) (.cse22 (not (= 2 |old(~t2_st~0)|))) (.cse23 (and .cse11 .cse46)) (.cse13 (not (= ~token~0 ~local~0))) (.cse2 (not .cse41)) (.cse14 (not (= ~E_M~0 2))) (.cse4 (not (= ~m_i~0 1))) (.cse5 (not (= |old(~t2_st~0)| 0))) (.cse26 (not (= ~m_pc~0 1))) (.cse16 (not (= ~t1_pc~0 1))) (.cse8 (not .cse38)) (.cse10 (not .cse45)) (.cse42 (not (<= .cse44 ~token~0))) (.cse34 (not (= 2 |old(~m_st~0)|))) (.cse43 (not (<= ~token~0 .cse44)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse2 .cse14 .cse15 .cse4 .cse16 .cse6 (and .cse17 .cse18 (= 2 ~t1_st~0) .cse19) .cse8 .cse20 .cse21 .cse22 .cse23 .cse13) (or .cse24 .cse1 .cse2 .cse25 .cse4 .cse26 .cse16 .cse7 .cse8 .cse11 .cse27 .cse12 .cse20 .cse21 .cse22 .cse28 .cse29 .cse30) (or .cse0 .cse1 .cse2 .cse14 .cse15 .cse4 .cse6 .cse8 (and .cse17 .cse18 .cse19 .cse31 .cse32) .cse9 .cse33 .cse21 .cse22 .cse23 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse33 .cse23 .cse13) (or .cse1 .cse2 .cse4 .cse26 .cse16 .cse7 .cse8 .cse11 .cse27 .cse34 .cse21 .cse35 .cse22 .cse13) (or .cse1 .cse2 .cse14 .cse15 .cse4 .cse5 .cse16 .cse6 .cse8 .cse10 (and .cse36 .cse17 .cse18 .cse37) .cse33 .cse20 .cse23 .cse13) (or .cse1 .cse2 .cse4 .cse16 .cse6 .cse7 (and .cse36 .cse17 .cse18 .cse19 .cse32) .cse8 .cse11 .cse20 .cse21 .cse22) (or .cse24 .cse1 .cse2 .cse25 .cse4 .cse26 .cse16 .cse7 .cse8 (and (= |activate_threads_is_master_triggered_~__retres1~0#1| 1) .cse38 .cse36 (= ~m_st~0 0) .cse39 .cse40 .cse19 .cse41 .cse32) .cse27 .cse20 .cse21 .cse29 .cse30 (not (= ~E_M~0 1))) (or .cse2 .cse4 .cse26 .cse16 .cse7 .cse8 .cse40 .cse11 .cse42 .cse27 .cse34 .cse21 .cse28 .cse43) (or .cse1 .cse2 .cse4 .cse26 .cse16 .cse7 .cse8 .cse11 .cse42 .cse27 .cse20 .cse34 .cse21 .cse35 .cse22 .cse43) (or .cse1 .cse2 .cse14 .cse15 .cse25 .cse4 .cse26 .cse16 .cse8 .cse33 (and .cse38 .cse36 .cse17 .cse18 .cse39 .cse40 .cse19 .cse41) .cse27 .cse20 .cse21 .cse22 .cse23 .cse13) (or (and .cse36 .cse17 .cse18 .cse37 .cse32) .cse2 .cse14 .cse4 .cse5 .cse26 .cse16 .cse8 .cse40 .cse10 .cse11 .cse42 .cse34 .cse43))))) [2021-11-25 19:36:37,674 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 450 460) no Hoare annotation was computed. [2021-11-25 19:36:37,675 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 450 460) the Hoare annotation is: (let ((.cse16 (= ~E_2~0 1))) (let ((.cse31 (not (= ~E_M~0 ~E_1~0))) (.cse38 (not (= ~E_1~0 1))) (.cse26 (= ~t1_i~0 1)) (.cse30 (not .cse16)) (.cse29 (= ~t2_i~0 1)) (.cse28 (<= 1 ~m_pc~0)) (.cse15 (+ ~local~0 1)) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse22 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (= |old(~t2_st~0)| ~t2_st~0))) (let ((.cse18 (not (= ~E_1~0 2))) (.cse2 (and .cse27 .cse22 .cse23)) (.cse32 (not (<= .cse15 ~token~0))) (.cse33 (not (= 2 |old(~m_st~0)|))) (.cse34 (not (<= ~token~0 .cse15))) (.cse17 (not (= ~m_pc~0 1))) (.cse19 (not .cse28)) (.cse20 (and .cse26 .cse27 .cse22 .cse28 .cse30 .cse23 .cse29)) (.cse11 (not (= ~t2_pc~0 1))) (.cse12 (not (= 2 |old(~t2_st~0)|))) (.cse6 (not (= ~t1_pc~0 1))) (.cse10 (not (= |old(~t1_st~0)| 2))) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse0 (not (= ~E_2~0 2))) (.cse1 (not .cse29)) (.cse3 (not (= ~E_M~0 2))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (= ~m_i~0 1))) (.cse35 (not (= |old(~t2_st~0)| 0))) (.cse24 (= ~t1_st~0 0)) (.cse37 (= 0 ~t2_st~0)) (.cse7 (not (<= ~m_pc~0 0))) (.cse8 (not .cse26)) (.cse25 (not (= ~t1_pc~0 0))) (.cse36 (not (<= ~t2_pc~0 0))) (.cse9 (and .cse38 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse13 (and .cse31 .cse38)) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (not (< .cse15 ~token~0)) .cse0 .cse1 .cse16 .cse5 .cse17 .cse6 .cse18 .cse8 .cse19 .cse10 .cse20 .cse11 (not (<= ~token~0 (+ 2 ~local~0))) (not (= ~E_M~0 1))) (or .cse21 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 (and .cse22 .cse23 .cse24) .cse8 .cse25 .cse9 .cse11 .cse12 .cse13 .cse14) (or (and .cse26 .cse27 .cse22 .cse28 .cse23 .cse29) .cse1 .cse5 .cse17 .cse6 .cse18 .cse8 .cse30 .cse31 .cse32 .cse19 .cse33 .cse11 .cse34) (or .cse1 .cse2 .cse3 .cse5 .cse35 .cse17 .cse6 .cse8 .cse30 .cse36 .cse31 .cse32 .cse33 .cse34) (or .cse0 .cse1 .cse3 .cse4 .cse16 .cse5 .cse17 .cse6 .cse8 .cse9 .cse19 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 (and .cse22 (= 2 ~t1_st~0) .cse37) .cse3 .cse4 .cse5 .cse35 .cse6 .cse7 .cse8 .cse36 .cse9 .cse10 .cse13 .cse14) (or .cse21 .cse0 .cse1 .cse3 .cse4 .cse5 .cse35 (and .cse22 .cse24 .cse37) .cse7 .cse8 .cse25 .cse36 .cse9 .cse13 .cse14))))) [2021-11-25 19:36:37,675 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 450 460) no Hoare annotation was computed. [2021-11-25 19:36:37,675 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 250 274) no Hoare annotation was computed. [2021-11-25 19:36:37,676 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 250 274) the Hoare annotation is: true [2021-11-25 19:36:37,676 INFO L854 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 340 377) the Hoare annotation is: (let ((.cse28 (= ~t1_pc~0 1)) (.cse26 (= ~t1_i~0 1)) (.cse27 (= 2 ~t2_st~0)) (.cse23 (= ~E_M~0 ~E_1~0)) (.cse22 (= ~t2_pc~0 1)) (.cse29 (= ~m_i~0 1)) (.cse30 (= ~t2_i~0 1)) (.cse24 (= ~E_2~0 |old(~E_2~0)|)) (.cse25 (= ~E_1~0 2)) (.cse31 (= ~m_st~0 2)) (.cse32 (= ~m_pc~0 1))) (let ((.cse16 (not (= ~m_st~0 0))) (.cse20 (not (= ~token~0 ~local~0))) (.cse4 (not .cse32)) (.cse10 (not (<= 2 |old(~E_1~0)|))) (.cse11 (= |old(~E_M~0)| 1)) (.cse18 (not .cse31)) (.cse13 (= |old(~E_2~0)| 1)) (.cse15 (not (<= 1 ~m_pc~0))) (.cse19 (and .cse28 .cse31 .cse26 (= ~E_M~0 |old(~E_M~0)|) .cse27 .cse23 .cse22 .cse32 .cse29 (= ~E_2~0 2) .cse30 (= ~E_1~0 |old(~E_1~0)|) .cse24 .cse25)) (.cse0 (+ ~local~0 1)) (.cse1 (not (= 2 |old(~E_2~0)|))) (.cse2 (not .cse30)) (.cse3 (not .cse29)) (.cse5 (not .cse28)) (.cse6 (not (= 2 |old(~E_1~0)|))) (.cse21 (not (<= ~m_pc~0 0))) (.cse7 (not .cse27)) (.cse8 (not .cse26)) (.cse9 (not (= 2 ~t1_st~0))) (.cse12 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse14 (and .cse23 .cse24 .cse25)) (.cse17 (not .cse22))) (and (or (not (< .cse0 ~token~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse18 .cse12 .cse13 .cse15 .cse17 .cse19 .cse20) (or .cse1 .cse2 .cse3 .cse6 .cse21 .cse8 (not (= ~t1_pc~0 0)) (not (<= ~t2_pc~0 0)) .cse12 .cse14 (not (= 0 ~t2_st~0)) (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse16) (not (= ~t1_st~0 0)) .cse20) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 (not (<= .cse0 ~token~0)) .cse13 .cse15 .cse17 .cse19 (not (<= ~token~0 .cse0))) (or .cse1 .cse2 .cse3 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse12 .cse14 .cse17)))) [2021-11-25 19:36:37,676 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 340 377) no Hoare annotation was computed. [2021-11-25 19:36:37,676 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 219 226) no Hoare annotation was computed. [2021-11-25 19:36:37,677 INFO L861 garLoopResultBuilder]: At program point update_channelsFINAL(lines 219 226) the Hoare annotation is: true [2021-11-25 19:36:37,677 INFO L854 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 378 415) the Hoare annotation is: (let ((.cse15 (not (= ~m_st~0 2))) (.cse9 (not (= ~token~0 ~local~0))) (.cse4 (not (<= ~m_pc~0 0))) (.cse16 (+ ~local~0 1)) (.cse0 (not (= 2 |old(~E_2~0)|))) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (not (= ~m_i~0 1))) (.cse10 (not (= ~m_pc~0 1))) (.cse11 (not (= ~t1_pc~0 1))) (.cse3 (not (= 2 |old(~E_1~0)|))) (.cse12 (not (= 2 ~t2_st~0))) (.cse5 (not (= ~t1_i~0 1))) (.cse13 (not (= 2 ~t1_st~0))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse6 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse7 (and (= ~E_M~0 ~E_1~0) (= ~E_2~0 |old(~E_2~0)|) (= ~E_1~0 2))) (.cse17 (not (<= 1 ~m_pc~0))) (.cse8 (not (= ~m_st~0 0))) (.cse18 (not (= ~t2_pc~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_pc~0 0)) (not (<= ~t2_pc~0 0)) .cse6 .cse7 (not (= 0 ~t2_st~0)) (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse8) (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse14 .cse15 .cse6 (not (<= .cse16 ~token~0)) .cse7 .cse17 .cse18 (not (<= ~token~0 .cse16))) (or .cse0 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse5 .cse14 .cse15 .cse6 .cse7 .cse17 .cse18 .cse9) (or .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse12 .cse5 .cse13 .cse6 .cse7 .cse18) (or (not (< .cse16 ~token~0)) .cse0 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse14 .cse6 .cse7 .cse17 .cse8 .cse18 (not (<= ~token~0 (+ 2 ~local~0)))))) [2021-11-25 19:36:37,677 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 378 415) no Hoare annotation was computed. [2021-11-25 19:36:37,678 INFO L854 garLoopResultBuilder]: At program point L151(line 151) the Hoare annotation is: (and (= ~t1_pc~0 1) (or (not (= 0 ~t2_st~0)) (= |exists_runnable_thread_#res| 1)) (= ~t1_i~0 1) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t1_st~0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_2~0 2) (= ~t2_i~0 1) (< (+ ~local~0 1) ~token~0) (= ~E_1~0 2) (= ~E_M~0 1)) [2021-11-25 19:36:37,678 INFO L858 garLoopResultBuilder]: For program point L151-1(line 151) no Hoare annotation was computed. [2021-11-25 19:36:37,678 INFO L854 garLoopResultBuilder]: At program point L548(line 548) the Hoare annotation is: (and (= ~t1_pc~0 0) (= ~t1_i~0 1) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (<= ~m_pc~0 0) (= ~t2_i~0 1) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2021-11-25 19:36:37,678 INFO L854 garLoopResultBuilder]: At program point L548-1(line 548) the Hoare annotation is: (and (= ~t1_pc~0 0) (= ~t1_i~0 1) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (<= ~m_pc~0 0) (= ~t2_i~0 1) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2021-11-25 19:36:37,678 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-11-25 19:36:37,679 INFO L858 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2021-11-25 19:36:37,679 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2021-11-25 19:36:37,679 INFO L854 garLoopResultBuilder]: At program point L565(line 565) the Hoare annotation is: (let ((.cse13 (+ ~local~0 1)) (.cse16 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse1 (<= 2 ~E_1~0)) (.cse17 (= ~m_st~0 2)) (.cse5 (<= 1 ~m_pc~0)) (.cse6 (not (= ~E_2~0 1))) (.cse9 (= ~m_pc~0 1)) (.cse15 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~t2_i~0 1)) (.cse14 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse13 ~token~0) .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse17 .cse2 .cse3 (<= ~token~0 .cse13) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse13 ~token~0) .cse11 .cse12 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 (<= ~m_pc~0 0) .cse12 .cse14))) [2021-11-25 19:36:37,679 INFO L854 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: false [2021-11-25 19:36:37,679 INFO L854 garLoopResultBuilder]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse14 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse1 (<= 2 ~E_1~0)) (.cse15 (= ~m_st~0 2)) (.cse5 (<= 1 ~m_pc~0)) (.cse8 (= ~m_pc~0 1)) (.cse12 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse6 (= ~E_M~0 ~E_1~0)) (.cse7 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~E_2~0 2)) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse12 ~token~0) .cse13) (and .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 (<= ~token~0 .cse12) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse12 ~token~0) .cse10 .cse11 .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 (<= ~m_pc~0 0) .cse11 .cse13))) [2021-11-25 19:36:37,680 INFO L854 garLoopResultBuilder]: At program point L334(lines 275 339) the Hoare annotation is: (let ((.cse13 (+ ~local~0 1)) (.cse16 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse1 (<= 2 ~E_1~0)) (.cse17 (= ~m_st~0 2)) (.cse5 (<= 1 ~m_pc~0)) (.cse6 (not (= ~E_2~0 1))) (.cse9 (= ~m_pc~0 1)) (.cse15 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~t2_i~0 1)) (.cse14 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse13 ~token~0) .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse17 .cse2 .cse3 (<= ~token~0 .cse13) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse13 ~token~0) .cse11 .cse12 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 (<= ~m_pc~0 0) .cse12 .cse14))) [2021-11-25 19:36:37,680 INFO L854 garLoopResultBuilder]: At program point L549(line 549) the Hoare annotation is: (and (= ~t1_pc~0 0) (= ~t1_i~0 1) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (<= ~m_pc~0 0) (= ~t2_i~0 1) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2021-11-25 19:36:37,680 INFO L854 garLoopResultBuilder]: At program point L54(lines 49 88) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~t1_i~0 1) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~E_M~0 ~E_1~0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (= ~t2_i~0 1) (< (+ ~local~0 1) ~token~0) (= ~E_1~0 2)) [2021-11-25 19:36:37,680 INFO L854 garLoopResultBuilder]: At program point L566(line 566) the Hoare annotation is: (let ((.cse5 (+ ~local~0 1)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse9 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse6 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse5 ~token~0) .cse11 .cse12 .cse13) (and .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse5 ~token~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 (<= ~m_pc~0 0) .cse12 .cse13))) [2021-11-25 19:36:37,681 INFO L854 garLoopResultBuilder]: At program point L319(lines 281 333) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse16 (+ ~local~0 1)) (.cse30 (= |exists_runnable_thread_#res| 1)) (.cse19 (= ~t1_st~0 0))) (let ((.cse1 (or .cse30 (not .cse19))) (.cse25 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse5 (<= ~token~0 .cse16)) (.cse11 (<= .cse16 ~token~0)) (.cse17 (= ~t1_pc~0 0)) (.cse18 (or .cse3 .cse15)) (.cse24 (= ~m_st~0 2)) (.cse9 (= ~m_pc~0 1)) (.cse26 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse21 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse6 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse12 (= ~E_2~0 2)) (.cse20 (<= ~m_pc~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 (< .cse16 ~token~0) .cse14) (and .cse17 .cse2 .cse18 .cse7 .cse19 .cse10 .cse12 .cse20 .cse13 .cse21 .cse22 .cse14 .cse23) (and .cse0 .cse24 .cse2 .cse4 .cse7 .cse25 .cse8 .cse9 .cse10 .cse12 .cse13 .cse22 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse22 .cse14) (and .cse17 .cse2 .cse3 .cse7 .cse19 .cse9 .cse10 .cse26 .cse12 .cse13 .cse21 .cse22 .cse14 .cse23) (and .cse0 .cse24 .cse2 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse21 .cse14 .cse23) (and .cse24 .cse17 .cse2 .cse4 .cse7 .cse19 .cse8 .cse9 .cse10 .cse26 .cse12 .cse13 .cse22 .cse14) (and .cse17 .cse2 .cse3 .cse4 .cse7 .cse19 .cse8 .cse10 .cse26 .cse12 .cse20 .cse13 .cse22 .cse14) (and (let ((.cse27 (<= 2 ~t1_st~0)) (.cse28 (not .cse15)) (.cse29 (not (= ~E_M~0 1)))) (or (and (or (and .cse0 .cse27 .cse2 .cse8 .cse9 .cse10 .cse26 .cse28 .cse13 .cse29) (and .cse0 .cse27 .cse2 .cse25 .cse8 .cse9 .cse10 .cse28 .cse13 .cse30 .cse29)) .cse7 .cse12 .cse14) (and .cse0 .cse27 .cse24 .cse2 .cse7 .cse25 .cse8 .cse9 .cse10 .cse12 .cse28 .cse13 .cse14 .cse29))) .cse5 .cse6 .cse11 .cse21) (and .cse17 .cse2 .cse4 .cse15 .cse7 .cse19 .cse8 .cse10 .cse26 .cse12 .cse20 .cse13 .cse22 .cse14) (and .cse0 .cse2 .cse6 .cse18 .cse7 .cse10 .cse26 .cse12 .cse20 .cse13 .cse21 .cse22 .cse14 .cse23) (and .cse0 .cse24 .cse2 .cse7 .cse9 .cse10 .cse26 .cse12 .cse13 .cse21 .cse22 .cse14 .cse23) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse12 .cse20 .cse13 .cse14)))) [2021-11-25 19:36:37,681 INFO L858 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2021-11-25 19:36:37,681 INFO L858 garLoopResultBuilder]: For program point L286-1(lines 281 333) no Hoare annotation was computed. [2021-11-25 19:36:37,681 INFO L854 garLoopResultBuilder]: At program point L567(line 567) the Hoare annotation is: (let ((.cse5 (+ ~local~0 1)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse9 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse6 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse5 ~token~0) .cse11 .cse12 .cse13) (and .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse5 ~token~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 (<= ~m_pc~0 0) .cse12 .cse13))) [2021-11-25 19:36:37,682 INFO L854 garLoopResultBuilder]: At program point L105-1(lines 93 124) the Hoare annotation is: (let ((.cse23 (+ ~local~0 1))) (let ((.cse15 (= ~m_st~0 0)) (.cse3 (<= ~token~0 .cse23)) (.cse9 (<= .cse23 ~token~0)) (.cse21 (= 2 ~t2_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse6 (= ~t2_pc~0 1)) (.cse1 (= ~m_st~0 2)) (.cse7 (= ~m_pc~0 1)) (.cse0 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse14 (= ~t1_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse22 (= ~m_st~0 ~E_M~0)) (.cse16 (not (= ~E_2~0 1))) (.cse5 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~m_i~0 1)) (.cse17 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse10 (= ~E_2~0 2)) (.cse18 (<= ~m_pc~0 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse13 (= ~E_1~0 2)) (.cse20 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse15 .cse16 .cse5 .cse8 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse13 .cse20) (and .cse0 .cse14 .cse2 .cse21 (or .cse22 .cse15) .cse5 .cse6 .cse8 .cse17 .cse10 .cse18 .cse11 .cse19 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse0 .cse1 .cse14 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse11 .cse19 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse7 .cse8 .cse17 .cse10 .cse11 .cse12 .cse19 .cse13 .cse20) (and .cse0 .cse14 .cse2 .cse22 .cse16 .cse5 .cse8 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse13 .cse20)))) [2021-11-25 19:36:37,682 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2021-11-25 19:36:37,682 INFO L858 garLoopResultBuilder]: For program point L305(lines 281 333) no Hoare annotation was computed. [2021-11-25 19:36:37,682 INFO L854 garLoopResultBuilder]: At program point L553-1(lines 550 590) the Hoare annotation is: (let ((.cse15 (= ~t1_st~0 0))) (let ((.cse5 (+ ~local~0 1)) (.cse14 (= ~m_st~0 0)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not .cse15))) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse9 (= ~m_pc~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse6 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~E_2~0 2)) (.cse16 (<= ~m_pc~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse5 ~token~0) .cse11 .cse12 .cse13) (and .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse5 ~token~0) .cse13) (and (= ~t1_pc~0 0) .cse2 (or .cse3 .cse14) .cse7 .cse15 .cse10 .cse11 .cse16 .cse12 (= 0 ~t2_st~0) .cse17 .cse13 (<= ~t2_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse16 .cse12 .cse13)))) [2021-11-25 19:36:37,683 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 329) no Hoare annotation was computed. [2021-11-25 19:36:37,683 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-25 19:36:37,683 INFO L858 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2021-11-25 19:36:37,683 INFO L854 garLoopResultBuilder]: At program point L141-1(lines 129 160) the Hoare annotation is: (let ((.cse19 (+ ~local~0 1)) (.cse18 (<= 1 ~m_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse0 (or (not (= 0 ~t2_st~0)) (= |exists_runnable_thread_#res| 1))) (.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse14 (not (= ~E_2~0 1))) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (= ~t1_st~0 0)) (.cse7 (= ~m_i~0 1)) (.cse8 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse9 (= ~E_2~0 2)) (.cse15 (<= ~m_pc~0 0)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~token~0 ~local~0)) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11 .cse12) (and .cse16 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse13 .cse17 .cse18 .cse14 .cse4 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) .cse6 .cse7 .cse9 .cse10 (< .cse19 ~token~0) .cse12) (and .cse16 .cse0 (= ~m_st~0 2) .cse2 (<= ~token~0 .cse19) .cse17 .cse4 .cse6 .cse7 (<= .cse19 ~token~0) .cse8 .cse9 .cse10 .cse12) (and .cse16 .cse0 .cse2 .cse3 .cse18 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse16 .cse0 .cse2 .cse17 (or .cse3 .cse13) .cse4 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11 .cse12))) [2021-11-25 19:36:37,684 INFO L854 garLoopResultBuilder]: At program point L75-1(lines 49 88) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse10 (<= ~m_pc~0 0)) (.cse16 (= 0 ~t2_st~0)) (.cse17 (= ~token~0 ~local~0)) (.cse18 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse1 .cse4 .cse14 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse12 .cse18) (and .cse13 .cse1 .cse2 .cse4 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse12 .cse18) (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) .cse7 .cse8 .cse9 .cse11 (< (+ ~local~0 1) ~token~0) .cse12))) [2021-11-25 19:36:37,684 INFO L858 garLoopResultBuilder]: For program point L291(lines 281 333) no Hoare annotation was computed. [2021-11-25 19:36:37,684 INFO L854 garLoopResultBuilder]: At program point L572(lines 572 581) the Hoare annotation is: (let ((.cse5 (+ ~local~0 1)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse9 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse6 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse5 ~token~0) .cse11 .cse12 .cse13) (and .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse5 ~token~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 (<= ~m_pc~0 0) .cse12 .cse13))) [2021-11-25 19:36:37,684 INFO L858 garLoopResultBuilder]: For program point L572-2(lines 572 581) no Hoare annotation was computed. [2021-11-25 19:36:37,684 INFO L858 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2021-11-25 19:36:37,685 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2021-11-25 19:36:37,685 INFO L861 garLoopResultBuilder]: At program point L591(lines 538 596) the Hoare annotation is: true [2021-11-25 19:36:37,685 INFO L854 garLoopResultBuilder]: At program point L525(line 525) the Hoare annotation is: (let ((.cse5 (+ ~local~0 1)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse9 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse6 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse5 ~token~0) .cse11 .cse12 .cse13) (and .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse5 ~token~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 (<= ~m_pc~0 0) .cse12 .cse13))) [2021-11-25 19:36:37,685 INFO L854 garLoopResultBuilder]: At program point L525-1(line 525) the Hoare annotation is: (let ((.cse5 (+ ~local~0 1)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse9 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse6 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse5 ~token~0) .cse11 .cse12 .cse13) (and .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse5 ~token~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 (<= ~m_pc~0 0) .cse12 .cse13))) [2021-11-25 19:36:37,685 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 301) no Hoare annotation was computed. [2021-11-25 19:36:37,686 INFO L858 garLoopResultBuilder]: For program point L130(lines 130 138) no Hoare annotation was computed. [2021-11-25 19:36:37,686 INFO L854 garLoopResultBuilder]: At program point L97(lines 97 101) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~E_M~0 ~E_1~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ~m_i~0 1)) (.cse6 (= ~E_2~0 2)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~token~0 ~local~0)) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 (= |ULTIMATE.start_eval_~tmp~0#1| 1) .cse6 .cse7 (= 0 ~t2_st~0) .cse8 .cse9 (<= ~t2_pc~0 0)) (and .cse0 .cse1 (= ~m_st~0 2) .cse2 .cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~t2_pc~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-11-25 19:36:37,686 INFO L854 garLoopResultBuilder]: At program point L576(line 576) the Hoare annotation is: (let ((.cse5 (+ ~local~0 1)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse9 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse6 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse5 ~token~0) .cse11 .cse12 .cse13) (and .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse5 ~token~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 (<= ~m_pc~0 0) .cse12 .cse13))) [2021-11-25 19:36:37,686 INFO L854 garLoopResultBuilder]: At program point L576-1(line 576) the Hoare annotation is: (let ((.cse5 (+ ~local~0 1)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse9 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse6 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse5 ~token~0) .cse11 .cse12 .cse13) (and .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse5 ~token~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 (<= ~m_pc~0 0) .cse12 .cse13))) [2021-11-25 19:36:37,687 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-11-25 19:36:37,687 INFO L854 garLoopResultBuilder]: At program point L115(line 115) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse2 (= ~m_st~0 2)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~E_2~0 1)) (.cse5 (<= ~token~0 .cse12)) (.cse6 (= ~E_M~0 ~E_1~0)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ~m_i~0 1)) (.cse9 (<= .cse12 ~token~0)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_eval_~tmp~0#1| 1) .cse10 .cse11 (= 0 ~t2_st~0) (<= ~t2_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~t2_pc~0 1) .cse7 .cse8 .cse9 .cse10 .cse11)))) [2021-11-25 19:36:37,687 INFO L858 garLoopResultBuilder]: For program point L115-1(line 115) no Hoare annotation was computed. [2021-11-25 19:36:37,687 INFO L854 garLoopResultBuilder]: At program point L561(line 561) the Hoare annotation is: (let ((.cse13 (+ ~local~0 1)) (.cse16 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse1 (<= 2 ~E_1~0)) (.cse17 (= ~m_st~0 2)) (.cse5 (<= 1 ~m_pc~0)) (.cse6 (not (= ~E_2~0 1))) (.cse9 (= ~m_pc~0 1)) (.cse15 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~t2_i~0 1)) (.cse14 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse13 ~token~0) .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse17 .cse2 .cse3 (<= ~token~0 .cse13) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse13 ~token~0) .cse11 .cse12 .cse14 .cse15) (and .cse0 .cse16 .cse1 .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~token~0 ~local~0) .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 (<= ~m_pc~0 0) .cse12 .cse14))) [2021-11-25 19:36:37,688 INFO L858 garLoopResultBuilder]: For program point L561-1(line 561) no Hoare annotation was computed. [2021-11-25 19:36:37,688 INFO L854 garLoopResultBuilder]: At program point L83(lines 46 89) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 0)) (.cse13 (= ~m_st~0 ~E_M~0)) (.cse3 (= 2 ~t2_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse5 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse15 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse16 (= 0 ~t2_st~0)) (.cse10 (= ~token~0 ~local~0)) (.cse11 (= ~E_1~0 2)) (.cse17 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse13 .cse4 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse17) (and .cse12 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse17))) [2021-11-25 19:36:37,688 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 58) no Hoare annotation was computed. [2021-11-25 19:36:37,688 INFO L854 garLoopResultBuilder]: At program point L133(lines 133 137) the Hoare annotation is: (let ((.cse21 (+ ~local~0 1))) (let ((.cse13 (= ~t1_pc~0 0)) (.cse15 (= ~t1_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse16 (<= ~token~0 .cse21)) (.cse5 (= ~m_pc~0 1)) (.cse18 (<= .cse21 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (or (not (= 0 ~t2_st~0)) (= |exists_runnable_thread_#res| 1))) (.cse3 (= ~t1_i~0 1)) (.cse17 (= 2 ~t1_st~0)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse19 (= ~m_st~0 0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse6 (= ~m_i~0 1)) (.cse7 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse8 (= ~E_2~0 2)) (.cse20 (<= ~m_pc~0 0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~token~0 ~local~0)) (.cse11 (= ~E_1~0 2)) (.cse12 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse16 .cse17 .cse4 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~t2_pc~0 1) .cse5 .cse6 .cse18 .cse8 .cse9 .cse11) (and .cse1 .cse13 .cse3 .cse19 .cse4 .cse15 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 .cse14 .cse4 .cse15 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse17 (or .cse14 .cse19) .cse4 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12)))) [2021-11-25 19:36:37,689 INFO L854 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse21 (= ~E_1~0 1))) (let ((.cse0 (= ~t1_pc~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse8 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (<= ~t2_pc~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (or .cse21 (= ~E_M~0 ~E_1~0))) (.cse3 (= 2 ~t2_st~0)) (.cse4 (or (= ~m_st~0 ~E_M~0) .cse21)) (.cse17 (= 2 ~t1_st~0)) (.cse20 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse9 (or .cse21 (and (or (= |old(~E_M~0)| 0) (= ~E_M~0 |old(~E_M~0)|)) (= ~E_1~0 |old(~E_1~0)|)))) (.cse10 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (<= ~m_pc~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse1 .cse2 .cse4 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15 .cse19) (and .cse16 .cse1 .cse2 .cse3 .cse4 .cse17 .cse20 .cse6 (= ~m_pc~0 1) .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15 .cse19) (and .cse16 .cse1 .cse2 .cse3 .cse4 .cse17 .cse20 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2021-11-25 19:36:37,689 INFO L854 garLoopResultBuilder]: At program point L546(line 546) the Hoare annotation is: (and (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~m_st~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (<= ~m_pc~0 0) (= ~t2_i~0 1) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2021-11-25 19:36:37,689 INFO L858 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2021-11-25 19:36:37,689 INFO L854 garLoopResultBuilder]: At program point L546-1(line 546) the Hoare annotation is: (and (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~m_st~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (<= ~m_pc~0 0) (= ~t2_i~0 1) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2021-11-25 19:36:37,690 INFO L854 garLoopResultBuilder]: At program point L282(line 282) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse16 (+ ~local~0 1)) (.cse30 (= |exists_runnable_thread_#res| 1)) (.cse19 (= ~t1_st~0 0))) (let ((.cse1 (or .cse30 (not .cse19))) (.cse25 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse5 (<= ~token~0 .cse16)) (.cse11 (<= .cse16 ~token~0)) (.cse17 (= ~t1_pc~0 0)) (.cse18 (or .cse3 .cse15)) (.cse24 (= ~m_st~0 2)) (.cse9 (= ~m_pc~0 1)) (.cse26 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse21 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse6 (= 2 ~t1_st~0)) (.cse7 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~t2_pc~0 1)) (.cse10 (= ~m_i~0 1)) (.cse12 (= ~E_2~0 2)) (.cse20 (<= ~m_pc~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 (< .cse16 ~token~0) .cse14) (and .cse17 .cse2 .cse18 .cse7 .cse19 .cse10 .cse12 .cse20 .cse13 .cse21 .cse22 .cse14 .cse23) (and .cse0 .cse24 .cse2 .cse4 .cse7 .cse25 .cse8 .cse9 .cse10 .cse12 .cse13 .cse22 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse22 .cse14) (and .cse17 .cse2 .cse3 .cse7 .cse19 .cse9 .cse10 .cse26 .cse12 .cse13 .cse21 .cse22 .cse14 .cse23) (and .cse0 .cse24 .cse2 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse21 .cse14 .cse23) (and .cse24 .cse17 .cse2 .cse4 .cse7 .cse19 .cse8 .cse9 .cse10 .cse26 .cse12 .cse13 .cse22 .cse14) (and .cse17 .cse2 .cse3 .cse4 .cse7 .cse19 .cse8 .cse10 .cse26 .cse12 .cse20 .cse13 .cse22 .cse14) (and (let ((.cse27 (<= 2 ~t1_st~0)) (.cse28 (not .cse15)) (.cse29 (not (= ~E_M~0 1)))) (or (and (or (and .cse0 .cse27 .cse2 .cse8 .cse9 .cse10 .cse26 .cse28 .cse13 .cse29) (and .cse0 .cse27 .cse2 .cse25 .cse8 .cse9 .cse10 .cse28 .cse13 .cse30 .cse29)) .cse7 .cse12 .cse14) (and .cse0 .cse27 .cse24 .cse2 .cse7 .cse25 .cse8 .cse9 .cse10 .cse12 .cse28 .cse13 .cse14 .cse29))) .cse5 .cse6 .cse11 .cse21) (and .cse17 .cse2 .cse4 .cse15 .cse7 .cse19 .cse8 .cse10 .cse26 .cse12 .cse20 .cse13 .cse22 .cse14) (and .cse0 .cse2 .cse6 .cse18 .cse7 .cse10 .cse26 .cse12 .cse20 .cse13 .cse21 .cse22 .cse14 .cse23) (and .cse0 .cse24 .cse2 .cse7 .cse9 .cse10 .cse26 .cse12 .cse13 .cse21 .cse22 .cse14 .cse23) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse12 .cse20 .cse13 .cse14)))) [2021-11-25 19:36:37,693 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 19:36:37,695 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 19:36:37,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 07:36:37 BoogieIcfgContainer [2021-11-25 19:36:37,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 19:36:37,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 19:36:37,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 19:36:37,788 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 19:36:37,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 07:33:56" (3/4) ... [2021-11-25 19:36:37,792 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-25 19:36:37,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-11-25 19:36:37,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-11-25 19:36:37,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-11-25 19:36:37,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-11-25 19:36:37,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-11-25 19:36:37,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-11-25 19:36:37,810 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2021-11-25 19:36:37,812 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-11-25 19:36:37,813 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-25 19:36:37,814 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-25 19:36:37,843 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) [2021-11-25 19:36:37,844 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) [2021-11-25 19:36:37,845 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(t2_i == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(token <= local + 1)) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && 0 == t2_st)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(token <= local + 1))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || (((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0) && 0 == t2_st)) || !(\old(m_st) == 0)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0) && 0 == t2_st)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || ((((((((((t1_pc == 1 && __retres1 == 1) && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token == local))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local)) [2021-11-25 19:36:37,845 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || ((((((((((((t1_pc == 0 && t1_i == 1) && (m_st == E_M || m_st == 0)) && E_M == E_1) && t1_st == 0) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) [2021-11-25 19:36:37,846 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) [2021-11-25 19:36:37,846 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2) && !(E_M == 1)) || ((((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && 2 <= E_1) && m_st == 2) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && 2 <= E_1) && m_st == 2) && t1_i == 1) && 2 == t2_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) && !(E_M == 1))) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) [2021-11-25 19:36:37,847 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || ((((((((((((t1_pc == 0 && t1_i == 1) && (m_st == E_M || m_st == 0)) && E_M == E_1) && t1_st == 0) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t2_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && t1_i == 1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && !(m_st == 0)) && t2_i == 1) && !(E_M == 1)) || ((((((((((t1_pc == 1 && 2 <= t1_st) && t1_i == 1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && !(m_st == 0)) && t2_i == 1) && \result == 1) && !(E_M == 1))) && E_M == E_1) && E_2 == 2) && E_1 == 2) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && m_st == 2) && t1_i == 1) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && E_1 == 2) && !(E_M == 1))) && token <= local + 1) && 2 == t1_st) && local + 1 <= token) && 0 == t2_st)) || (((((((((((((t1_pc == 0 && t1_i == 1) && 2 == t2_st) && m_st == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t1_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) [2021-11-25 19:36:37,848 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 1 <= m_pc) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && E_1 == 2) || (((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(E_2 == 1)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && token <= local + 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && 1 <= m_pc) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && !(E_2 == 1)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) [2021-11-25 19:36:37,848 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && m_st == 2) && t1_i == 1) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) [2021-11-25 19:36:37,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(token == local)) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(t1_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(2 <= E_1)) || !(token <= 2 + local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || ((((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t1_pc == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && t2_pc <= 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(E_1 == 2)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_i == 1)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((__retres1 == 1 && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(token <= local + 1))) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st) && __retres1 == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(token <= local + 1)) [2021-11-25 19:36:37,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(E_2 == 1)) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && !(tmp == 0)) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && m_st == E_M) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && 2 == t1_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && !(E_2 == 1)) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) [2021-11-25 19:36:37,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == 0) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && 2 == t1_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0) [2021-11-25 19:36:37,851 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local)) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || (((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(token <= local + 1))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || (((((__retres1 == 1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((!(E_2 == 2) || ((((((((t1_i == 1 && m_st == \old(m_st)) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1) && __retres1 == 0) && __retres1 == 0)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((!(t2_i == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 1) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(token <= local + 1))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || (((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || ((((((t1_i == 1 && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local)) [2021-11-25 19:36:37,897 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/witness.graphml [2021-11-25 19:36:37,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 19:36:37,898 INFO L158 Benchmark]: Toolchain (without parser) took 163004.51ms. Allocated memory was 94.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 72.8MB in the beginning and 878.0MB in the end (delta: -805.2MB). Peak memory consumption was 378.0MB. Max. memory is 16.1GB. [2021-11-25 19:36:37,899 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 94.4MB. Free memory was 68.9MB in the beginning and 68.9MB in the end (delta: 23.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 19:36:37,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.13ms. Allocated memory is still 94.4MB. Free memory was 72.6MB in the beginning and 66.7MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-25 19:36:37,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.04ms. Allocated memory is still 94.4MB. Free memory was 66.7MB in the beginning and 64.3MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 19:36:37,900 INFO L158 Benchmark]: Boogie Preprocessor took 30.81ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 62.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 19:36:37,900 INFO L158 Benchmark]: RCFGBuilder took 705.67ms. Allocated memory is still 94.4MB. Free memory was 62.7MB in the beginning and 35.7MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-25 19:36:37,901 INFO L158 Benchmark]: TraceAbstraction took 161654.99ms. Allocated memory was 94.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 35.3MB in the beginning and 886.4MB in the end (delta: -851.1MB). Peak memory consumption was 763.6MB. Max. memory is 16.1GB. [2021-11-25 19:36:37,901 INFO L158 Benchmark]: Witness Printer took 109.68ms. Allocated memory is still 1.3GB. Free memory was 886.4MB in the beginning and 878.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-25 19:36:37,903 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.27ms. Allocated memory is still 94.4MB. Free memory was 68.9MB in the beginning and 68.9MB in the end (delta: 23.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.13ms. Allocated memory is still 94.4MB. Free memory was 72.6MB in the beginning and 66.7MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.04ms. Allocated memory is still 94.4MB. Free memory was 66.7MB in the beginning and 64.3MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.81ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 62.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 705.67ms. Allocated memory is still 94.4MB. Free memory was 62.7MB in the beginning and 35.7MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 161654.99ms. Allocated memory was 94.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 35.3MB in the beginning and 886.4MB in the end (delta: -851.1MB). Peak memory consumption was 763.6MB. Max. memory is 16.1GB. * Witness Printer took 109.68ms. Allocated memory is still 1.3GB. Free memory was 886.4MB in the beginning and 878.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 161.5s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 73.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7251 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7188 mSDsluCounter, 10700 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8627 mSDsCounter, 2868 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8806 IncrementalHoareTripleChecker+Invalid, 11674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2868 mSolverCounterUnsat, 3346 mSDtfsCounter, 8806 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3014 GetRequests, 2471 SyntacticMatches, 35 SemanticMatches, 508 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23215 ImplicationChecksByTransitivity, 39.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3834occurred in iteration=17, InterpolantAutomatonStates: 291, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 5984 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 6766 PreInvPairs, 7033 NumberOfFragments, 11815 HoareAnnotationTreeSize, 6766 FomulaSimplifications, 588570 FormulaSimplificationTreeSizeReduction, 47.2s HoareSimplificationTime, 41 FomulaSimplificationsInter, 1018753 FormulaSimplificationTreeSizeReductionInter, 26.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 4189 NumberOfCodeBlocks, 4134 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4577 ConstructedInterpolants, 0 QuantifiedInterpolants, 8758 SizeOfPredicates, 31 NumberOfNonLiveVariables, 7586 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 44 InterpolantComputations, 21 PerfectInterpolantSequences, 3077/3402 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 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && local + 1 < token) && E_1 == 2 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(t2_i == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(token <= local + 1)) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && 0 == t2_st)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(token <= local + 1))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || (((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0) && 0 == t2_st)) || !(\old(m_st) == 0)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0) && 0 == t2_st)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || ((((((((((t1_pc == 1 && __retres1 == 1) && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token == local))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(token == local)) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(t1_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(2 <= E_1)) || !(token <= 2 + local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || ((((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t1_pc == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && t2_pc <= 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(E_1 == 2)) || ((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_i == 1)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((__retres1 == 1 && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(token <= local + 1))) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st) && __retres1 == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(token <= local + 1)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t2_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) || (((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && m_st == 2) && t1_i == 1) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || ((((((((((((t1_pc == 0 && t1_i == 1) && (m_st == E_M || m_st == 0)) && E_M == E_1) && t1_st == 0) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) - InvariantResult [Line: 546]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 0 && t1_i == 1) && m_st == 0) && E_M == E_1) && t1_st == 0) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == 0) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && 2 == t1_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0) - InvariantResult [Line: 525]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 1 <= m_pc) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && E_1 == 2) || (((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(E_2 == 1)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && token <= local + 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && 1 <= m_pc) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && !(E_2 == 1)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) - InvariantResult [Line: 538]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_i == 1) && E_2 == 2) && !(m_st == 0)) && m_pc <= 0) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 0 && t1_i == 1) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && !(m_st == 0)) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((t1_pc == 0 && t1_i == 1) && 2 == t2_st) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && !(m_st == 0)) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t1_st) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && !(m_st == 0)) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && local + 1 < token) && E_1 == 2) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(E_2 == 1)) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && !(tmp == 0)) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && m_st == E_M) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && 2 == t1_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && !(E_2 == 1)) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local)) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || (((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(token <= local + 1))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || (((((__retres1 == 1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((!(E_2 == 2) || ((((((((t1_i == 1 && m_st == \old(m_st)) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1) && __retres1 == 0) && __retres1 == 0)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((!(t2_i == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 1) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(token <= local + 1))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || (((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || ((((((t1_i == 1 && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local)) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2) && !(E_M == 1)) || ((((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && 2 <= E_1) && m_st == 2) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && 2 <= E_1) && m_st == 2) && t1_i == 1) && 2 == t2_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) && !(E_M == 1))) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || ((((((((((((t1_pc == 0 && t1_i == 1) && (m_st == E_M || m_st == 0)) && E_M == E_1) && t1_st == 0) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t2_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && t1_i == 1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && !(m_st == 0)) && t2_i == 1) && !(E_M == 1)) || ((((((((((t1_pc == 1 && 2 <= t1_st) && t1_i == 1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && !(m_st == 0)) && t2_i == 1) && \result == 1) && !(E_M == 1))) && E_M == E_1) && E_2 == 2) && E_1 == 2) || (((((((((((((t1_pc == 1 && 2 <= t1_st) && m_st == 2) && t1_i == 1) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && E_1 == 2) && !(E_M == 1))) && token <= local + 1) && 2 == t1_st) && local + 1 <= token) && 0 == t2_st)) || (((((((((((((t1_pc == 0 && t1_i == 1) && 2 == t2_st) && m_st == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t1_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) RESULT: Ultimate proved your program to be correct! [2021-11-25 19:36:38,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_21e0334d-a834-4712-a9cb-e6fe0710fc56/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE