./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW --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 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 13:52:49,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:52:49,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:52:49,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:52:49,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:52:49,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:52:49,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:52:49,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:52:49,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:52:49,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:52:49,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:52:49,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:52:49,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:52:49,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:52:49,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:52:49,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:52:49,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:52:49,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:52:49,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:52:49,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:52:49,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:52:49,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:52:49,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:52:49,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:52:49,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:52:49,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:52:49,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:52:49,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:52:49,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:52:49,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:52:49,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:52:49,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:52:49,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:52:49,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:52:49,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:52:49,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:52:49,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:52:49,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:52:49,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:52:49,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:52:49,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:52:49,228 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 13:52:49,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:52:49,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:52:49,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:52:49,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:52:49,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:52:49,252 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:52:49,252 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:52:49,253 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:52:49,253 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:52:49,253 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:52:49,253 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:52:49,253 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:52:49,254 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:52:49,254 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:52:49,254 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:52:49,255 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:52:49,255 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:52:49,255 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:52:49,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:52:49,256 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:52:49,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:52:49,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:52:49,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:52:49,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 13:52:49,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:52:49,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 13:52:49,258 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:52:49,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 13:52:49,258 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:52:49,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 13:52:49,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:52:49,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:52:49,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:49,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:52:49,260 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:52:49,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:52:49,260 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 13:52:49,260 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:52:49,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:52:49,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 13:52:49,261 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:52:49,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/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_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW 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 -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2022-11-23 13:52:49,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:52:49,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:52:49,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:52:49,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:52:49,613 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:52:49,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2022-11-23 13:52:52,768 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:52:53,044 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:52:53,047 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2022-11-23 13:52:53,060 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/data/61549029e/76de3caa7c014da4bfbe496b7784f8e6/FLAGc6098c607 [2022-11-23 13:52:53,074 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/data/61549029e/76de3caa7c014da4bfbe496b7784f8e6 [2022-11-23 13:52:53,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:52:53,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:52:53,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:53,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:52:53,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:52:53,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f2050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53, skipping insertion in model container [2022-11-23 13:52:53,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:52:53,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:52:53,289 WARN L237 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_d2bc4672-a6da-43cd-936c-ac47999ec175/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2022-11-23 13:52:53,348 WARN L237 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_d2bc4672-a6da-43cd-936c-ac47999ec175/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2022-11-23 13:52:53,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:53,415 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:52:53,429 WARN L237 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_d2bc4672-a6da-43cd-936c-ac47999ec175/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2022-11-23 13:52:53,481 WARN L237 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_d2bc4672-a6da-43cd-936c-ac47999ec175/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2022-11-23 13:52:53,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:52:53,547 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:52:53,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53 WrapperNode [2022-11-23 13:52:53,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:52:53,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:53,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:52:53,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:52:53,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,641 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 498 [2022-11-23 13:52:53,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:52:53,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:52:53,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:52:53,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:52:53,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,690 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:52:53,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:52:53,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:52:53,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:52:53,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (1/1) ... [2022-11-23 13:52:53,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:52:53,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:52:53,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:52:53,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:52:53,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:52:53,808 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-23 13:52:53,808 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-23 13:52:53,808 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-23 13:52:53,808 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-23 13:52:53,808 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-23 13:52:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-23 13:52:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-23 13:52:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-23 13:52:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-23 13:52:53,809 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-23 13:52:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-23 13:52:53,810 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-23 13:52:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-23 13:52:53,810 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-23 13:52:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-23 13:52:53,811 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-23 13:52:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-23 13:52:53,811 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-23 13:52:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-23 13:52:53,812 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-23 13:52:53,812 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-23 13:52:53,812 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-23 13:52:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:52:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-23 13:52:53,814 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-23 13:52:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-23 13:52:53,816 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-23 13:52:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:52:53,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:52:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-23 13:52:53,817 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-23 13:52:53,978 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:52:53,996 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:52:54,609 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-11-23 13:52:54,623 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-11-23 13:52:54,698 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:52:54,953 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:52:54,954 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-23 13:52:54,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:54 BoogieIcfgContainer [2022-11-23 13:52:54,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:52:54,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:52:54,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:52:54,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:52:54,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:52:53" (1/3) ... [2022-11-23 13:52:54,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c57f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:54, skipping insertion in model container [2022-11-23 13:52:54,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:52:53" (2/3) ... [2022-11-23 13:52:54,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c57f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:52:54, skipping insertion in model container [2022-11-23 13:52:54,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:54" (3/3) ... [2022-11-23 13:52:54,969 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2022-11-23 13:52:54,988 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:52:54,989 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 13:52:55,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:52:55,052 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@d164910, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:52:55,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-23 13:52:55,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 114 states have internal predecessors, (161), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-23 13:52:55,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 13:52:55,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:55,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:55,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:52:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:55,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1579192629, now seen corresponding path program 1 times [2022-11-23 13:52:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:55,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494723292] [2022-11-23 13:52:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:55,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:55,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494723292] [2022-11-23 13:52:55,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494723292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:55,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:55,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:52:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767517759] [2022-11-23 13:52:55,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:55,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:52:55,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:55,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:52:55,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:52:55,591 INFO L87 Difference]: Start difference. First operand has 157 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 114 states have internal predecessors, (161), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) [2022-11-23 13:52:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:56,292 INFO L93 Difference]: Finished difference Result 571 states and 847 transitions. [2022-11-23 13:52:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:52:56,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 37 [2022-11-23 13:52:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:56,308 INFO L225 Difference]: With dead ends: 571 [2022-11-23 13:52:56,309 INFO L226 Difference]: Without dead ends: 409 [2022-11-23 13:52:56,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:52:56,316 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 556 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:56,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 574 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 13:52:56,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-11-23 13:52:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 398. [2022-11-23 13:52:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 282 states have (on average 1.3865248226950355) internal successors, (391), 289 states have internal predecessors, (391), 77 states have call successors, (77), 38 states have call predecessors, (77), 37 states have return successors, (97), 72 states have call predecessors, (97), 75 states have call successors, (97) [2022-11-23 13:52:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 565 transitions. [2022-11-23 13:52:56,406 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 565 transitions. Word has length 37 [2022-11-23 13:52:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:56,407 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 565 transitions. [2022-11-23 13:52:56,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) [2022-11-23 13:52:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 565 transitions. [2022-11-23 13:52:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-23 13:52:56,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:56,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:56,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 13:52:56,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:52:56,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1155886822, now seen corresponding path program 1 times [2022-11-23 13:52:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:56,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900887594] [2022-11-23 13:52:56,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:56,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:56,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900887594] [2022-11-23 13:52:56,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900887594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:56,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:56,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 13:52:56,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543894705] [2022-11-23 13:52:56,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:56,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:52:56,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:56,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:52:56,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 13:52:56,547 INFO L87 Difference]: Start difference. First operand 398 states and 565 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 13:52:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:56,894 INFO L93 Difference]: Finished difference Result 598 states and 842 transitions. [2022-11-23 13:52:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:52:56,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2022-11-23 13:52:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:56,906 INFO L225 Difference]: With dead ends: 598 [2022-11-23 13:52:56,907 INFO L226 Difference]: Without dead ends: 527 [2022-11-23 13:52:56,913 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:52:56,914 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 269 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:56,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 419 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:52:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-11-23 13:52:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 516. [2022-11-23 13:52:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 366 states have (on average 1.3743169398907105) internal successors, (503), 373 states have internal predecessors, (503), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (120), 92 states have call predecessors, (120), 95 states have call successors, (120) [2022-11-23 13:52:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 720 transitions. [2022-11-23 13:52:57,016 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 720 transitions. Word has length 44 [2022-11-23 13:52:57,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:57,016 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 720 transitions. [2022-11-23 13:52:57,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 13:52:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 720 transitions. [2022-11-23 13:52:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 13:52:57,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:57,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:57,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 13:52:57,028 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:52:57,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 863856876, now seen corresponding path program 1 times [2022-11-23 13:52:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:57,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168197690] [2022-11-23 13:52:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:57,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:57,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168197690] [2022-11-23 13:52:57,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168197690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:57,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:57,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:52:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809317411] [2022-11-23 13:52:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:57,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:52:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:52:57,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:52:57,176 INFO L87 Difference]: Start difference. First operand 516 states and 720 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 13:52:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:57,995 INFO L93 Difference]: Finished difference Result 1053 states and 1443 transitions. [2022-11-23 13:52:57,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:52:57,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2022-11-23 13:52:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:58,002 INFO L225 Difference]: With dead ends: 1053 [2022-11-23 13:52:58,003 INFO L226 Difference]: Without dead ends: 587 [2022-11-23 13:52:58,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:52:58,013 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 654 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:58,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 795 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 13:52:58,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-11-23 13:52:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 502. [2022-11-23 13:52:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 352 states have (on average 1.3352272727272727) internal successors, (470), 359 states have internal predecessors, (470), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (117), 92 states have call predecessors, (117), 95 states have call successors, (117) [2022-11-23 13:52:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 684 transitions. [2022-11-23 13:52:58,090 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 684 transitions. Word has length 45 [2022-11-23 13:52:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:58,091 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 684 transitions. [2022-11-23 13:52:58,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 13:52:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 684 transitions. [2022-11-23 13:52:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-23 13:52:58,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:58,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:58,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 13:52:58,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:52:58,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:58,095 INFO L85 PathProgramCache]: Analyzing trace with hash 857725223, now seen corresponding path program 1 times [2022-11-23 13:52:58,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:58,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022252899] [2022-11-23 13:52:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:58,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:58,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:58,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022252899] [2022-11-23 13:52:58,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022252899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:58,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:58,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:52:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099910800] [2022-11-23 13:52:58,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:58,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:52:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:58,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:52:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:52:58,236 INFO L87 Difference]: Start difference. First operand 502 states and 684 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 13:52:58,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:58,956 INFO L93 Difference]: Finished difference Result 968 states and 1292 transitions. [2022-11-23 13:52:58,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:52:58,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2022-11-23 13:52:58,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:58,962 INFO L225 Difference]: With dead ends: 968 [2022-11-23 13:52:58,963 INFO L226 Difference]: Without dead ends: 791 [2022-11-23 13:52:58,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:52:58,974 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 568 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:58,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 737 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 13:52:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-11-23 13:52:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 766. [2022-11-23 13:52:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 533 states have (on average 1.2926829268292683) internal successors, (689), 540 states have internal predecessors, (689), 146 states have call successors, (146), 86 states have call predecessors, (146), 85 states have return successors, (183), 141 states have call predecessors, (183), 144 states have call successors, (183) [2022-11-23 13:52:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1018 transitions. [2022-11-23 13:52:59,069 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1018 transitions. Word has length 46 [2022-11-23 13:52:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:59,070 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1018 transitions. [2022-11-23 13:52:59,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-23 13:52:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1018 transitions. [2022-11-23 13:52:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-23 13:52:59,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:59,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:59,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 13:52:59,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:52:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash 63830602, now seen corresponding path program 1 times [2022-11-23 13:52:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:59,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421490084] [2022-11-23 13:52:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:59,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:59,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421490084] [2022-11-23 13:52:59,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421490084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:59,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:59,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:52:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483399532] [2022-11-23 13:52:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:59,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:52:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:59,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:52:59,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:52:59,159 INFO L87 Difference]: Start difference. First operand 766 states and 1018 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-23 13:52:59,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:59,254 INFO L93 Difference]: Finished difference Result 767 states and 1019 transitions. [2022-11-23 13:52:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:52:59,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2022-11-23 13:52:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:59,259 INFO L225 Difference]: With dead ends: 767 [2022-11-23 13:52:59,259 INFO L226 Difference]: Without dead ends: 323 [2022-11-23 13:52:59,261 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:52:59,262 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:59,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 158 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:52:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-23 13:52:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-11-23 13:52:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 231 states have (on average 1.3722943722943723) internal successors, (317), 235 states have internal predecessors, (317), 61 states have call successors, (61), 30 states have call predecessors, (61), 30 states have return successors, (83), 58 states have call predecessors, (83), 61 states have call successors, (83) [2022-11-23 13:52:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 461 transitions. [2022-11-23 13:52:59,323 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 461 transitions. Word has length 50 [2022-11-23 13:52:59,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:59,324 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 461 transitions. [2022-11-23 13:52:59,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-23 13:52:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 461 transitions. [2022-11-23 13:52:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-23 13:52:59,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:59,327 INFO L195 NwaCegarLoop]: 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] [2022-11-23 13:52:59,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 13:52:59,328 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:52:59,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash 50429275, now seen corresponding path program 1 times [2022-11-23 13:52:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:59,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077636904] [2022-11-23 13:52:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:59,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 13:52:59,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:59,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077636904] [2022-11-23 13:52:59,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077636904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:59,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:59,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:52:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850611757] [2022-11-23 13:52:59,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:59,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:52:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:59,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:52:59,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:52:59,766 INFO L87 Difference]: Start difference. First operand 323 states and 461 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) [2022-11-23 13:53:00,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:00,088 INFO L93 Difference]: Finished difference Result 846 states and 1232 transitions. [2022-11-23 13:53:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 13:53:00,088 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 [2022-11-23 13:53:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:00,092 INFO L225 Difference]: With dead ends: 846 [2022-11-23 13:53:00,092 INFO L226 Difference]: Without dead ends: 530 [2022-11-23 13:53:00,094 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:53:00,094 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 222 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:00,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 322 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-11-23 13:53:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 500. [2022-11-23 13:53:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 357 states have (on average 1.3529411764705883) internal successors, (483), 363 states have internal predecessors, (483), 94 states have call successors, (94), 48 states have call predecessors, (94), 48 states have return successors, (131), 89 states have call predecessors, (131), 94 states have call successors, (131) [2022-11-23 13:53:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 708 transitions. [2022-11-23 13:53:00,159 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 708 transitions. Word has length 66 [2022-11-23 13:53:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:00,160 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 708 transitions. [2022-11-23 13:53:00,160 INFO L496 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) [2022-11-23 13:53:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 708 transitions. [2022-11-23 13:53:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-23 13:53:00,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:00,162 INFO L195 NwaCegarLoop]: 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] [2022-11-23 13:53:00,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 13:53:00,163 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:00,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:00,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1020376246, now seen corresponding path program 1 times [2022-11-23 13:53:00,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:00,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279308571] [2022-11-23 13:53:00,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:00,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 13:53:00,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:00,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279308571] [2022-11-23 13:53:00,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279308571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:00,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:00,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:53:00,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001318131] [2022-11-23 13:53:00,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:00,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:53:00,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:00,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:53:00,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:00,417 INFO L87 Difference]: Start difference. First operand 500 states and 708 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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) [2022-11-23 13:53:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:00,760 INFO L93 Difference]: Finished difference Result 1486 states and 2164 transitions. [2022-11-23 13:53:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 13:53:00,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 67 [2022-11-23 13:53:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:00,767 INFO L225 Difference]: With dead ends: 1486 [2022-11-23 13:53:00,767 INFO L226 Difference]: Without dead ends: 993 [2022-11-23 13:53:00,769 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:53:00,770 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 216 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:00,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 268 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-11-23 13:53:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 943. [2022-11-23 13:53:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 670 states have (on average 1.328358208955224) internal successors, (890), 681 states have internal predecessors, (890), 176 states have call successors, (176), 96 states have call predecessors, (176), 96 states have return successors, (243), 166 states have call predecessors, (243), 176 states have call successors, (243) [2022-11-23 13:53:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1309 transitions. [2022-11-23 13:53:00,876 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1309 transitions. Word has length 67 [2022-11-23 13:53:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:00,876 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1309 transitions. [2022-11-23 13:53:00,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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) [2022-11-23 13:53:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1309 transitions. [2022-11-23 13:53:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-23 13:53:00,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:00,879 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:53:00,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 13:53:00,880 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:00,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash -182346185, now seen corresponding path program 1 times [2022-11-23 13:53:00,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:00,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128642664] [2022-11-23 13:53:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:00,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-23 13:53:00,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:00,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128642664] [2022-11-23 13:53:00,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128642664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:00,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:00,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:53:00,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838292178] [2022-11-23 13:53:00,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:00,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:00,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:00,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:00,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:53:00,959 INFO L87 Difference]: Start difference. First operand 943 states and 1309 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2022-11-23 13:53:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:01,114 INFO L93 Difference]: Finished difference Result 1958 states and 2750 transitions. [2022-11-23 13:53:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:01,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 68 [2022-11-23 13:53:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:01,121 INFO L225 Difference]: With dead ends: 1958 [2022-11-23 13:53:01,122 INFO L226 Difference]: Without dead ends: 1140 [2022-11-23 13:53:01,125 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:53:01,125 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 36 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:01,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 215 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:53:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-11-23 13:53:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1023. [2022-11-23 13:53:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 738 states have (on average 1.3414634146341464) internal successors, (990), 749 states have internal predecessors, (990), 182 states have call successors, (182), 102 states have call predecessors, (182), 102 states have return successors, (249), 172 states have call predecessors, (249), 182 states have call successors, (249) [2022-11-23 13:53:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1421 transitions. [2022-11-23 13:53:01,267 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1421 transitions. Word has length 68 [2022-11-23 13:53:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:01,268 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1421 transitions. [2022-11-23 13:53:01,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2022-11-23 13:53:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1421 transitions. [2022-11-23 13:53:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-23 13:53:01,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:01,272 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:53:01,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 13:53:01,272 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:01,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944015, now seen corresponding path program 1 times [2022-11-23 13:53:01,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:01,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162571100] [2022-11-23 13:53:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:01,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-23 13:53:01,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:01,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162571100] [2022-11-23 13:53:01,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162571100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:01,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:01,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:53:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672576242] [2022-11-23 13:53:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:01,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:01,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:01,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:53:01,339 INFO L87 Difference]: Start difference. First operand 1023 states and 1421 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) [2022-11-23 13:53:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:01,565 INFO L93 Difference]: Finished difference Result 2544 states and 3583 transitions. [2022-11-23 13:53:01,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:01,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 87 [2022-11-23 13:53:01,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:01,575 INFO L225 Difference]: With dead ends: 2544 [2022-11-23 13:53:01,575 INFO L226 Difference]: Without dead ends: 1527 [2022-11-23 13:53:01,580 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:53:01,582 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 73 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:01,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 179 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:53:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2022-11-23 13:53:01,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1514. [2022-11-23 13:53:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1093 states have (on average 1.3211344922232389) internal successors, (1444), 1109 states have internal predecessors, (1444), 267 states have call successors, (267), 153 states have call predecessors, (267), 153 states have return successors, (364), 252 states have call predecessors, (364), 267 states have call successors, (364) [2022-11-23 13:53:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2075 transitions. [2022-11-23 13:53:01,799 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2075 transitions. Word has length 87 [2022-11-23 13:53:01,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:01,800 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 2075 transitions. [2022-11-23 13:53:01,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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) [2022-11-23 13:53:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2075 transitions. [2022-11-23 13:53:01,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-23 13:53:01,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:01,811 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:53:01,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 13:53:01,811 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1507846843, now seen corresponding path program 1 times [2022-11-23 13:53:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:01,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346051545] [2022-11-23 13:53:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-23 13:53:01,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:01,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346051545] [2022-11-23 13:53:01,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346051545] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:01,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112803696] [2022-11-23 13:53:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:01,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:01,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:01,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:01,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 13:53:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:02,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 13:53:02,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 13:53:02,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:02,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112803696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:02,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:53:02,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 13:53:02,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628537912] [2022-11-23 13:53:02,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:02,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:02,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:02,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:02,230 INFO L87 Difference]: Start difference. First operand 1514 states and 2075 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) [2022-11-23 13:53:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:02,578 INFO L93 Difference]: Finished difference Result 2970 states and 4109 transitions. [2022-11-23 13:53:02,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:02,579 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 101 [2022-11-23 13:53:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:02,590 INFO L225 Difference]: With dead ends: 2970 [2022-11-23 13:53:02,590 INFO L226 Difference]: Without dead ends: 1855 [2022-11-23 13:53:02,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:02,603 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:02,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 115 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2022-11-23 13:53:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1799. [2022-11-23 13:53:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1340 states have (on average 1.3074626865671641) internal successors, (1752), 1353 states have internal predecessors, (1752), 273 states have call successors, (273), 183 states have call predecessors, (273), 185 states have return successors, (369), 263 states have call predecessors, (369), 273 states have call successors, (369) [2022-11-23 13:53:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2394 transitions. [2022-11-23 13:53:02,845 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2394 transitions. Word has length 101 [2022-11-23 13:53:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:02,845 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2394 transitions. [2022-11-23 13:53:02,846 INFO L496 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) [2022-11-23 13:53:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2394 transitions. [2022-11-23 13:53:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-23 13:53:02,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:02,852 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:02,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 13:53:03,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 13:53:03,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:03,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:03,056 INFO L85 PathProgramCache]: Analyzing trace with hash -727865914, now seen corresponding path program 1 times [2022-11-23 13:53:03,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:03,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267120669] [2022-11-23 13:53:03,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:03,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-23 13:53:03,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:03,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267120669] [2022-11-23 13:53:03,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267120669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:03,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572145777] [2022-11-23 13:53:03,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:03,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:03,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:03,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:03,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 13:53:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:03,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 13:53:03,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 13:53:03,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:03,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572145777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:03,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:53:03,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 13:53:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028526168] [2022-11-23 13:53:03,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:03,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:03,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:03,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:03,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:03,366 INFO L87 Difference]: Start difference. First operand 1799 states and 2394 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, (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) [2022-11-23 13:53:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:03,696 INFO L93 Difference]: Finished difference Result 3439 states and 4640 transitions. [2022-11-23 13:53:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:03,696 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, (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 101 [2022-11-23 13:53:03,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:03,708 INFO L225 Difference]: With dead ends: 3439 [2022-11-23 13:53:03,708 INFO L226 Difference]: Without dead ends: 2223 [2022-11-23 13:53:03,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:03,713 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:03,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:53:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2022-11-23 13:53:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1928. [2022-11-23 13:53:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1460 states have internal predecessors, (1908), 284 states have call successors, (284), 194 states have call predecessors, (284), 196 states have return successors, (380), 274 states have call predecessors, (380), 284 states have call successors, (380) [2022-11-23 13:53:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2572 transitions. [2022-11-23 13:53:04,067 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2572 transitions. Word has length 101 [2022-11-23 13:53:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:04,068 INFO L495 AbstractCegarLoop]: Abstraction has 1928 states and 2572 transitions. [2022-11-23 13:53:04,068 INFO L496 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, (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) [2022-11-23 13:53:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2572 transitions. [2022-11-23 13:53:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-23 13:53:04,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:04,073 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:53:04,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:04,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 13:53:04,292 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:04,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:04,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1699267653, now seen corresponding path program 2 times [2022-11-23 13:53:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:04,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006672587] [2022-11-23 13:53:04,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:04,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-23 13:53:04,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:04,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006672587] [2022-11-23 13:53:04,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006672587] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:04,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216850054] [2022-11-23 13:53:04,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:53:04,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:04,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:04,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:04,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 13:53:04,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 13:53:04,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:53:04,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 13:53:04,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-23 13:53:04,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:04,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216850054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:04,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:53:04,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-11-23 13:53:04,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580936046] [2022-11-23 13:53:04,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:04,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:53:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:04,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:53:04,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 13:53:04,760 INFO L87 Difference]: Start difference. First operand 1928 states and 2572 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 13:53:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:05,102 INFO L93 Difference]: Finished difference Result 3494 states and 4658 transitions. [2022-11-23 13:53:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:53:05,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-23 13:53:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:05,115 INFO L225 Difference]: With dead ends: 3494 [2022-11-23 13:53:05,115 INFO L226 Difference]: Without dead ends: 2082 [2022-11-23 13:53:05,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:53:05,121 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 86 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:05,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 370 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-11-23 13:53:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2013. [2022-11-23 13:53:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1507 states have (on average 1.3125414731254148) internal successors, (1978), 1526 states have internal predecessors, (1978), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2022-11-23 13:53:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2676 transitions. [2022-11-23 13:53:05,396 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2676 transitions. Word has length 101 [2022-11-23 13:53:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:05,397 INFO L495 AbstractCegarLoop]: Abstraction has 2013 states and 2676 transitions. [2022-11-23 13:53:05,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 13:53:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2676 transitions. [2022-11-23 13:53:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-23 13:53:05,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:05,402 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:05,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 13:53:05,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 13:53:05,608 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash 825789958, now seen corresponding path program 2 times [2022-11-23 13:53:05,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:05,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231050170] [2022-11-23 13:53:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-23 13:53:05,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:05,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231050170] [2022-11-23 13:53:05,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231050170] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:05,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600346635] [2022-11-23 13:53:05,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:53:05,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:05,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:05,817 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:05,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 13:53:05,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 13:53:05,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:53:05,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 13:53:05,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 13:53:05,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:05,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600346635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:05,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:53:05,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-23 13:53:05,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245001961] [2022-11-23 13:53:05,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:05,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:05,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:05,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:05,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:05,980 INFO L87 Difference]: Start difference. First operand 2013 states and 2676 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2022-11-23 13:53:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:06,306 INFO L93 Difference]: Finished difference Result 3400 states and 4713 transitions. [2022-11-23 13:53:06,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:06,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 101 [2022-11-23 13:53:06,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:06,316 INFO L225 Difference]: With dead ends: 3400 [2022-11-23 13:53:06,316 INFO L226 Difference]: Without dead ends: 2023 [2022-11-23 13:53:06,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:06,321 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 82 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:06,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 222 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2022-11-23 13:53:06,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2007. [2022-11-23 13:53:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1501 states have (on average 1.2764823451032645) internal successors, (1916), 1520 states have internal predecessors, (1916), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2022-11-23 13:53:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2614 transitions. [2022-11-23 13:53:06,620 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2614 transitions. Word has length 101 [2022-11-23 13:53:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:06,621 INFO L495 AbstractCegarLoop]: Abstraction has 2007 states and 2614 transitions. [2022-11-23 13:53:06,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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) [2022-11-23 13:53:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2614 transitions. [2022-11-23 13:53:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-23 13:53:06,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:06,628 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:53:06,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:06,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 13:53:06,833 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:06,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1974996728, now seen corresponding path program 1 times [2022-11-23 13:53:06,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:06,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292798010] [2022-11-23 13:53:06,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:06,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-23 13:53:07,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:07,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292798010] [2022-11-23 13:53:07,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292798010] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:07,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892051271] [2022-11-23 13:53:07,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:07,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:07,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:07,159 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:07,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 13:53:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:07,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 13:53:07,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 13:53:07,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:07,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892051271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:07,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:53:07,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-23 13:53:07,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481288936] [2022-11-23 13:53:07,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:07,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:07,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:07,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:07,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:07,363 INFO L87 Difference]: Start difference. First operand 2007 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2022-11-23 13:53:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:07,761 INFO L93 Difference]: Finished difference Result 3862 states and 5182 transitions. [2022-11-23 13:53:07,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:07,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 101 [2022-11-23 13:53:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:07,774 INFO L225 Difference]: With dead ends: 3862 [2022-11-23 13:53:07,774 INFO L226 Difference]: Without dead ends: 2408 [2022-11-23 13:53:07,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:07,780 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 76 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:07,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 234 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2022-11-23 13:53:08,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2346. [2022-11-23 13:53:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 1766 states have (on average 1.2621744054360136) internal successors, (2229), 1788 states have internal predecessors, (2229), 335 states have call successors, (335), 232 states have call predecessors, (335), 244 states have return successors, (484), 326 states have call predecessors, (484), 335 states have call successors, (484) [2022-11-23 13:53:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3048 transitions. [2022-11-23 13:53:08,100 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3048 transitions. Word has length 101 [2022-11-23 13:53:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:08,100 INFO L495 AbstractCegarLoop]: Abstraction has 2346 states and 3048 transitions. [2022-11-23 13:53:08,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2022-11-23 13:53:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3048 transitions. [2022-11-23 13:53:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-23 13:53:08,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:08,107 INFO L195 NwaCegarLoop]: 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] [2022-11-23 13:53:08,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-23 13:53:08,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:08,313 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:08,313 INFO L85 PathProgramCache]: Analyzing trace with hash 151407579, now seen corresponding path program 1 times [2022-11-23 13:53:08,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:08,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671058511] [2022-11-23 13:53:08,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-23 13:53:08,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:08,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671058511] [2022-11-23 13:53:08,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671058511] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:08,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428619475] [2022-11-23 13:53:08,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:08,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:08,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:08,516 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:08,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 13:53:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:08,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 13:53:08,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-23 13:53:08,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:08,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428619475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:08,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:53:08,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-23 13:53:08,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152506531] [2022-11-23 13:53:08,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:08,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:08,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:08,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:08,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:08,695 INFO L87 Difference]: Start difference. First operand 2346 states and 3048 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, (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) [2022-11-23 13:53:09,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:09,124 INFO L93 Difference]: Finished difference Result 5495 states and 7182 transitions. [2022-11-23 13:53:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:09,125 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, (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 [2022-11-23 13:53:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:09,142 INFO L225 Difference]: With dead ends: 5495 [2022-11-23 13:53:09,143 INFO L226 Difference]: Without dead ends: 3195 [2022-11-23 13:53:09,152 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:53:09,153 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 187 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 [2022-11-23 13:53:09,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 187 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:53:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2022-11-23 13:53:09,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 2586. [2022-11-23 13:53:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2586 states, 1964 states have (on average 1.269857433808554) internal successors, (2494), 1987 states have internal predecessors, (2494), 356 states have call successors, (356), 253 states have call predecessors, (356), 265 states have return successors, (505), 346 states have call predecessors, (505), 356 states have call successors, (505) [2022-11-23 13:53:09,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3355 transitions. [2022-11-23 13:53:09,545 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3355 transitions. Word has length 100 [2022-11-23 13:53:09,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:09,546 INFO L495 AbstractCegarLoop]: Abstraction has 2586 states and 3355 transitions. [2022-11-23 13:53:09,546 INFO L496 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, (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) [2022-11-23 13:53:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3355 transitions. [2022-11-23 13:53:09,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-23 13:53:09,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:09,554 INFO L195 NwaCegarLoop]: 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] [2022-11-23 13:53:09,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:09,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 13:53:09,755 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:09,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2664700, now seen corresponding path program 1 times [2022-11-23 13:53:09,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:09,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141658875] [2022-11-23 13:53:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:09,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-23 13:53:10,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:10,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141658875] [2022-11-23 13:53:10,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141658875] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:10,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396471746] [2022-11-23 13:53:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:10,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:10,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:10,246 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:10,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 13:53:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:10,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 13:53:10,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-23 13:53:10,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:10,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396471746] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:10,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:53:10,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2022-11-23 13:53:10,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387855560] [2022-11-23 13:53:10,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:10,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:53:10,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:10,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:53:10,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-11-23 13:53:10,606 INFO L87 Difference]: Start difference. First operand 2586 states and 3355 transitions. Second operand has 6 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 13:53:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:11,341 INFO L93 Difference]: Finished difference Result 4458 states and 5979 transitions. [2022-11-23 13:53:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:53:11,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-23 13:53:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:11,355 INFO L225 Difference]: With dead ends: 4458 [2022-11-23 13:53:11,356 INFO L226 Difference]: Without dead ends: 2687 [2022-11-23 13:53:11,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:53:11,363 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 111 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:11,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 168 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2022-11-23 13:53:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2671. [2022-11-23 13:53:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 2039 states have (on average 1.2452182442373712) internal successors, (2539), 2062 states have internal predecessors, (2539), 358 states have call successors, (358), 261 states have call predecessors, (358), 273 states have return successors, (508), 348 states have call predecessors, (508), 358 states have call successors, (508) [2022-11-23 13:53:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3405 transitions. [2022-11-23 13:53:11,918 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3405 transitions. Word has length 101 [2022-11-23 13:53:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:11,919 INFO L495 AbstractCegarLoop]: Abstraction has 2671 states and 3405 transitions. [2022-11-23 13:53:11,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-23 13:53:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3405 transitions. [2022-11-23 13:53:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-23 13:53:11,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:11,925 INFO L195 NwaCegarLoop]: 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] [2022-11-23 13:53:11,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:12,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 13:53:12,131 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1547328139, now seen corresponding path program 1 times [2022-11-23 13:53:12,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:12,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028776913] [2022-11-23 13:53:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-23 13:53:12,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:12,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028776913] [2022-11-23 13:53:12,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028776913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:12,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692079447] [2022-11-23 13:53:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:12,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:12,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:12,243 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:12,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 13:53:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:12,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 13:53:12,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 13:53:12,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:12,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692079447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:12,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:53:12,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-23 13:53:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173487827] [2022-11-23 13:53:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:12,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:53:12,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:53:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:12,420 INFO L87 Difference]: Start difference. First operand 2671 states and 3405 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, (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) [2022-11-23 13:53:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:12,851 INFO L93 Difference]: Finished difference Result 4281 states and 5436 transitions. [2022-11-23 13:53:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:53:12,852 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, (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 101 [2022-11-23 13:53:12,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:12,876 INFO L225 Difference]: With dead ends: 4281 [2022-11-23 13:53:12,876 INFO L226 Difference]: Without dead ends: 3044 [2022-11-23 13:53:12,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:12,881 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 42 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:12,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 217 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:53:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2022-11-23 13:53:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2839. [2022-11-23 13:53:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2175 states have (on average 1.2501149425287357) internal successors, (2719), 2198 states have internal predecessors, (2719), 374 states have call successors, (374), 277 states have call predecessors, (374), 289 states have return successors, (524), 364 states have call predecessors, (524), 374 states have call successors, (524) [2022-11-23 13:53:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3617 transitions. [2022-11-23 13:53:13,236 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3617 transitions. Word has length 101 [2022-11-23 13:53:13,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:13,236 INFO L495 AbstractCegarLoop]: Abstraction has 2839 states and 3617 transitions. [2022-11-23 13:53:13,237 INFO L496 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, (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) [2022-11-23 13:53:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3617 transitions. [2022-11-23 13:53:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-23 13:53:13,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:13,243 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:53:13,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:13,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 13:53:13,448 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:13,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash 644121779, now seen corresponding path program 1 times [2022-11-23 13:53:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:13,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319833658] [2022-11-23 13:53:13,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:13,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-23 13:53:13,594 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:13,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319833658] [2022-11-23 13:53:13,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319833658] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:13,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103868397] [2022-11-23 13:53:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:13,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:13,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:13,599 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:13,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 13:53:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:13,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:53:13,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 13:53:13,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:13,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103868397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:13,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:53:13,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-23 13:53:13,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927045070] [2022-11-23 13:53:13,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:13,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:53:13,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:13,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:53:13,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:13,859 INFO L87 Difference]: Start difference. First operand 2839 states and 3617 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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) [2022-11-23 13:53:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:14,474 INFO L93 Difference]: Finished difference Result 6355 states and 8113 transitions. [2022-11-23 13:53:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 13:53:14,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 102 [2022-11-23 13:53:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:14,495 INFO L225 Difference]: With dead ends: 6355 [2022-11-23 13:53:14,495 INFO L226 Difference]: Without dead ends: 3844 [2022-11-23 13:53:14,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:53:14,504 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 115 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:14,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 242 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:53:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2022-11-23 13:53:14,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3177. [2022-11-23 13:53:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 2485 states have (on average 1.2225352112676056) internal successors, (3038), 2507 states have internal predecessors, (3038), 373 states have call successors, (373), 305 states have call predecessors, (373), 318 states have return successors, (548), 365 states have call predecessors, (548), 373 states have call successors, (548) [2022-11-23 13:53:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 3959 transitions. [2022-11-23 13:53:15,014 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 3959 transitions. Word has length 102 [2022-11-23 13:53:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:15,014 INFO L495 AbstractCegarLoop]: Abstraction has 3177 states and 3959 transitions. [2022-11-23 13:53:15,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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) [2022-11-23 13:53:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 3959 transitions. [2022-11-23 13:53:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-23 13:53:15,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:15,021 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:53:15,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:15,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 13:53:15,227 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:15,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1683201521, now seen corresponding path program 1 times [2022-11-23 13:53:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:15,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432853918] [2022-11-23 13:53:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-23 13:53:15,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:15,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432853918] [2022-11-23 13:53:15,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432853918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:15,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:15,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:53:15,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822287475] [2022-11-23 13:53:15,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:15,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:53:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:53:15,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:53:15,454 INFO L87 Difference]: Start difference. First operand 3177 states and 3959 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-23 13:53:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:16,384 INFO L93 Difference]: Finished difference Result 7984 states and 9969 transitions. [2022-11-23 13:53:16,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:53:16,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 103 [2022-11-23 13:53:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:16,412 INFO L225 Difference]: With dead ends: 7984 [2022-11-23 13:53:16,412 INFO L226 Difference]: Without dead ends: 4156 [2022-11-23 13:53:16,422 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:53:16,423 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 76 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:16,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 342 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2022-11-23 13:53:17,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 4038. [2022-11-23 13:53:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4038 states, 3118 states have (on average 1.206863373957665) internal successors, (3763), 3143 states have internal predecessors, (3763), 503 states have call successors, (503), 407 states have call predecessors, (503), 416 states have return successors, (726), 488 states have call predecessors, (726), 503 states have call successors, (726) [2022-11-23 13:53:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4038 states to 4038 states and 4992 transitions. [2022-11-23 13:53:17,234 INFO L78 Accepts]: Start accepts. Automaton has 4038 states and 4992 transitions. Word has length 103 [2022-11-23 13:53:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:17,235 INFO L495 AbstractCegarLoop]: Abstraction has 4038 states and 4992 transitions. [2022-11-23 13:53:17,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-23 13:53:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4038 states and 4992 transitions. [2022-11-23 13:53:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-23 13:53:17,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:17,241 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:53:17,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 13:53:17,241 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:17,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1834855246, now seen corresponding path program 1 times [2022-11-23 13:53:17,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:17,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460453509] [2022-11-23 13:53:17,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-23 13:53:17,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:17,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460453509] [2022-11-23 13:53:17,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460453509] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:17,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768125413] [2022-11-23 13:53:17,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:17,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:17,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:17,427 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:17,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 13:53:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:17,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-23 13:53:17,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:17,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:53:17,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768125413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:17,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:53:17,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-23 13:53:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740546522] [2022-11-23 13:53:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:17,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:53:17,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:53:17,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:53:17,637 INFO L87 Difference]: Start difference. First operand 4038 states and 4992 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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) [2022-11-23 13:53:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:18,460 INFO L93 Difference]: Finished difference Result 6798 states and 8364 transitions. [2022-11-23 13:53:18,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:53:18,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 103 [2022-11-23 13:53:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:18,476 INFO L225 Difference]: With dead ends: 6798 [2022-11-23 13:53:18,476 INFO L226 Difference]: Without dead ends: 4019 [2022-11-23 13:53:18,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:53:18,484 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 163 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:18,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 355 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:53:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2022-11-23 13:53:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 3803. [2022-11-23 13:53:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3803 states, 2933 states have (on average 1.1868394135697238) internal successors, (3481), 2961 states have internal predecessors, (3481), 471 states have call successors, (471), 384 states have call predecessors, (471), 398 states have return successors, (657), 458 states have call predecessors, (657), 471 states have call successors, (657) [2022-11-23 13:53:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 4609 transitions. [2022-11-23 13:53:19,079 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 4609 transitions. Word has length 103 [2022-11-23 13:53:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:19,080 INFO L495 AbstractCegarLoop]: Abstraction has 3803 states and 4609 transitions. [2022-11-23 13:53:19,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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) [2022-11-23 13:53:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 4609 transitions. [2022-11-23 13:53:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-23 13:53:19,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:19,085 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:53:19,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:19,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:19,291 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:53:19,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:19,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1829084049, now seen corresponding path program 1 times [2022-11-23 13:53:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:19,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328103508] [2022-11-23 13:53:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-23 13:53:19,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:19,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328103508] [2022-11-23 13:53:19,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328103508] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:19,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235139423] [2022-11-23 13:53:19,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:19,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:19,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:19,903 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:19,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 13:53:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:20,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-23 13:53:20,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 13:53:20,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:53:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-23 13:53:20,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235139423] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:53:20,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1983618313] [2022-11-23 13:53:20,549 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2022-11-23 13:53:20,549 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:53:20,553 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 13:53:20,559 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 13:53:20,559 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 13:53:35,471 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 189 for LOIs [2022-11-23 13:53:37,516 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 61 for LOIs [2022-11-23 13:53:37,525 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 195 for LOIs [2022-11-23 13:53:37,590 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 81 for LOIs [2022-11-23 13:53:37,812 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 61 for LOIs [2022-11-23 13:53:38,417 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 219 for LOIs [2022-11-23 13:53:39,035 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 13:54:07,796 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '146038#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= ~t1_pc~0 0) (<= |#NULL.offset| 0) (<= ~q_req_up~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (<= 1 ~m_i~0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (<= 0 ~q_ev~0) (= 0 ~t2_pc~0) (<= ~m_i~0 1) (= ~q_read_ev~0 0) (= ~m_st~0 1) (<= 0 ~q_req_up~0) (<= ~q_ev~0 0) (= ~a_t~0 0) (<= 0 |#NULL.offset|) (<= 0 ~fast_clk_edge~0) (<= ~fast_clk_edge~0 0) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-23 13:54:07,797 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 13:54:07,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:54:07,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 21 [2022-11-23 13:54:07,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073340687] [2022-11-23 13:54:07,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:54:07,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 13:54:07,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:07,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 13:54:07,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=4113, Unknown=0, NotChecked=0, Total=4556 [2022-11-23 13:54:07,801 INFO L87 Difference]: Start difference. First operand 3803 states and 4609 transitions. Second operand has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 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) [2022-11-23 13:54:11,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:11,217 INFO L93 Difference]: Finished difference Result 8019 states and 9712 transitions. [2022-11-23 13:54:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-11-23 13:54:11,219 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 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 109 [2022-11-23 13:54:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:11,234 INFO L225 Difference]: With dead ends: 8019 [2022-11-23 13:54:11,234 INFO L226 Difference]: Without dead ends: 4213 [2022-11-23 13:54:11,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 302 SyntacticMatches, 17 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8677 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=1392, Invalid=18068, Unknown=0, NotChecked=0, Total=19460 [2022-11-23 13:54:11,247 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 799 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:11,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1914 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-23 13:54:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2022-11-23 13:54:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 3133. [2022-11-23 13:54:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 2451 states have (on average 1.1623827009383925) internal successors, (2849), 2487 states have internal predecessors, (2849), 343 states have call successors, (343), 307 states have call predecessors, (343), 338 states have return successors, (449), 338 states have call predecessors, (449), 343 states have call successors, (449) [2022-11-23 13:54:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 3641 transitions. [2022-11-23 13:54:11,689 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 3641 transitions. Word has length 109 [2022-11-23 13:54:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:11,690 INFO L495 AbstractCegarLoop]: Abstraction has 3133 states and 3641 transitions. [2022-11-23 13:54:11,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 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) [2022-11-23 13:54:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 3641 transitions. [2022-11-23 13:54:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-23 13:54:11,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:11,695 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:54:11,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 13:54:11,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-23 13:54:11,901 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:54:11,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1694649747, now seen corresponding path program 1 times [2022-11-23 13:54:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:11,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799464532] [2022-11-23 13:54:11,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-23 13:54:12,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:12,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799464532] [2022-11-23 13:54:12,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799464532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:54:12,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257051208] [2022-11-23 13:54:12,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:12,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:54:12,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:54:12,468 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:54:12,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 13:54:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:12,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-23 13:54:12,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:54:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 13:54:12,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:54:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-23 13:54:13,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257051208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:54:13,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [812806052] [2022-11-23 13:54:13,070 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2022-11-23 13:54:13,071 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:54:13,071 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 13:54:13,071 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 13:54:13,072 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 13:54:20,904 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 199 for LOIs [2022-11-23 13:54:25,347 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 73 for LOIs [2022-11-23 13:54:25,359 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 205 for LOIs [2022-11-23 13:54:25,455 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 82 for LOIs [2022-11-23 13:54:25,582 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 73 for LOIs [2022-11-23 13:54:25,986 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 229 for LOIs [2022-11-23 13:54:28,611 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 13:54:36,144 WARN L233 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 228 DAG size of output: 182 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:54:48,061 WARN L233 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 317 DAG size of output: 192 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:55:02,358 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '162493#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-23 13:55:02,358 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 13:55:02,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:55:02,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 22 [2022-11-23 13:55:02,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285420581] [2022-11-23 13:55:02,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:55:02,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 13:55:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:02,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 13:55:02,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=4692, Unknown=0, NotChecked=0, Total=5112 [2022-11-23 13:55:02,361 INFO L87 Difference]: Start difference. First operand 3133 states and 3641 transitions. Second operand has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 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) [2022-11-23 13:55:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:06,583 INFO L93 Difference]: Finished difference Result 5956 states and 6977 transitions. [2022-11-23 13:55:06,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-11-23 13:55:06,586 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 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 112 [2022-11-23 13:55:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:06,597 INFO L225 Difference]: With dead ends: 5956 [2022-11-23 13:55:06,597 INFO L226 Difference]: Without dead ends: 2966 [2022-11-23 13:55:06,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 315 SyntacticMatches, 12 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13808 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=1821, Invalid=28979, Unknown=0, NotChecked=0, Total=30800 [2022-11-23 13:55:06,612 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 1139 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:06,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 1682 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 13:55:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2022-11-23 13:55:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2328. [2022-11-23 13:55:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 1828 states have (on average 1.1564551422319476) internal successors, (2114), 1857 states have internal predecessors, (2114), 245 states have call successors, (245), 225 states have call predecessors, (245), 254 states have return successors, (331), 245 states have call predecessors, (331), 245 states have call successors, (331) [2022-11-23 13:55:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 2690 transitions. [2022-11-23 13:55:06,980 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 2690 transitions. Word has length 112 [2022-11-23 13:55:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:06,981 INFO L495 AbstractCegarLoop]: Abstraction has 2328 states and 2690 transitions. [2022-11-23 13:55:06,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 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) [2022-11-23 13:55:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2690 transitions. [2022-11-23 13:55:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-23 13:55:06,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:06,985 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:55:06,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 13:55:07,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:55:07,191 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:55:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:07,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1815227635, now seen corresponding path program 1 times [2022-11-23 13:55:07,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:07,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522940612] [2022-11-23 13:55:07,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:07,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-23 13:55:07,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:07,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522940612] [2022-11-23 13:55:07,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522940612] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:55:07,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027301215] [2022-11-23 13:55:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:07,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:55:07,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:55:07,853 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:55:07,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 13:55:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:08,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 13:55:08,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:55:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-23 13:55:08,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:55:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-23 13:55:09,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027301215] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:55:09,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1386303955] [2022-11-23 13:55:09,121 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-11-23 13:55:09,121 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:55:09,121 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 13:55:09,121 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 13:55:09,122 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 13:55:26,961 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 130 for LOIs [2022-11-23 13:55:27,000 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 130 for LOIs [2022-11-23 13:55:27,031 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 151 for LOIs [2022-11-23 13:55:27,060 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 140 for LOIs [2022-11-23 13:55:27,341 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 132 for LOIs [2022-11-23 13:55:27,772 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 151 for LOIs [2022-11-23 13:55:27,816 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 13:55:52,816 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '174929#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (<= 0 ~t2_pc~0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (<= ~t2_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-23 13:55:52,816 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 13:55:52,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:55:52,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 32 [2022-11-23 13:55:52,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592876087] [2022-11-23 13:55:52,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:55:52,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 13:55:52,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:52,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 13:55:52,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=6242, Unknown=0, NotChecked=0, Total=6806 [2022-11-23 13:55:52,819 INFO L87 Difference]: Start difference. First operand 2328 states and 2690 transitions. Second operand has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2022-11-23 13:55:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:59,147 INFO L93 Difference]: Finished difference Result 6737 states and 8021 transitions. [2022-11-23 13:55:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-23 13:55:59,148 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) Word has length 115 [2022-11-23 13:55:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:59,164 INFO L225 Difference]: With dead ends: 6737 [2022-11-23 13:55:59,164 INFO L226 Difference]: Without dead ends: 5053 [2022-11-23 13:55:59,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 280 SyntacticMatches, 22 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10764 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=2637, Invalid=21543, Unknown=0, NotChecked=0, Total=24180 [2022-11-23 13:55:59,172 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2768 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 2961 mSolverCounterSat, 1676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2777 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 4637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1676 IncrementalHoareTripleChecker+Valid, 2961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:59,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2777 Valid, 937 Invalid, 4637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1676 Valid, 2961 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-23 13:55:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5053 states. [2022-11-23 13:55:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5053 to 2015. [2022-11-23 13:55:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1578 states have (on average 1.1546261089987326) internal successors, (1822), 1591 states have internal predecessors, (1822), 226 states have call successors, (226), 208 states have call predecessors, (226), 210 states have return successors, (268), 215 states have call predecessors, (268), 226 states have call successors, (268) [2022-11-23 13:55:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2316 transitions. [2022-11-23 13:55:59,613 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2316 transitions. Word has length 115 [2022-11-23 13:55:59,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:59,613 INFO L495 AbstractCegarLoop]: Abstraction has 2015 states and 2316 transitions. [2022-11-23 13:55:59,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2022-11-23 13:55:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2316 transitions. [2022-11-23 13:55:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-23 13:55:59,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:59,617 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:55:59,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 13:55:59,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 13:55:59,823 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:55:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash 600715879, now seen corresponding path program 1 times [2022-11-23 13:55:59,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:59,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557104417] [2022-11-23 13:55:59,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:59,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-23 13:56:00,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:00,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557104417] [2022-11-23 13:56:00,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557104417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:00,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:00,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:56:00,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964109298] [2022-11-23 13:56:00,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:00,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 13:56:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:00,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 13:56:00,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:56:00,159 INFO L87 Difference]: Start difference. First operand 2015 states and 2316 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-23 13:56:01,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:01,151 INFO L93 Difference]: Finished difference Result 5661 states and 6543 transitions. [2022-11-23 13:56:01,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:56:01,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 127 [2022-11-23 13:56:01,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:01,164 INFO L225 Difference]: With dead ends: 5661 [2022-11-23 13:56:01,165 INFO L226 Difference]: Without dead ends: 4346 [2022-11-23 13:56:01,168 INFO L412 NwaCegarLoop]: 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 [2022-11-23 13:56:01,169 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 227 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:01,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 546 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:56:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2022-11-23 13:56:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 2978. [2022-11-23 13:56:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2978 states, 2319 states have (on average 1.1604139715394566) internal successors, (2691), 2337 states have internal predecessors, (2691), 341 states have call successors, (341), 307 states have call predecessors, (341), 317 states have return successors, (399), 333 states have call predecessors, (399), 341 states have call successors, (399) [2022-11-23 13:56:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2978 states and 3431 transitions. [2022-11-23 13:56:01,678 INFO L78 Accepts]: Start accepts. Automaton has 2978 states and 3431 transitions. Word has length 127 [2022-11-23 13:56:01,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:01,679 INFO L495 AbstractCegarLoop]: Abstraction has 2978 states and 3431 transitions. [2022-11-23 13:56:01,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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) [2022-11-23 13:56:01,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 3431 transitions. [2022-11-23 13:56:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-23 13:56:01,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:01,684 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:56:01,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-23 13:56:01,685 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:56:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1766197489, now seen corresponding path program 1 times [2022-11-23 13:56:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:01,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839265910] [2022-11-23 13:56:01,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-23 13:56:01,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:01,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839265910] [2022-11-23 13:56:01,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839265910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:56:01,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126258240] [2022-11-23 13:56:01,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:01,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:56:01,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:56:01,859 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:56:01,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 13:56:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:02,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 13:56:02,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:56:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-23 13:56:02,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:56:02,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126258240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:02,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:56:02,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-23 13:56:02,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785544803] [2022-11-23 13:56:02,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:02,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:56:02,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:02,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:56:02,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:56:02,060 INFO L87 Difference]: Start difference. First operand 2978 states and 3431 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2022-11-23 13:56:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:02,581 INFO L93 Difference]: Finished difference Result 4337 states and 4969 transitions. [2022-11-23 13:56:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:56:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 [2022-11-23 13:56:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:02,586 INFO L225 Difference]: With dead ends: 4337 [2022-11-23 13:56:02,586 INFO L226 Difference]: Without dead ends: 1812 [2022-11-23 13:56:02,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:56:02,595 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:02,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 329 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:56:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2022-11-23 13:56:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1620. [2022-11-23 13:56:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1263 states have (on average 1.1282660332541568) internal successors, (1425), 1274 states have internal predecessors, (1425), 180 states have call successors, (180), 164 states have call predecessors, (180), 176 states have return successors, (212), 181 states have call predecessors, (212), 180 states have call successors, (212) [2022-11-23 13:56:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 1817 transitions. [2022-11-23 13:56:02,958 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 1817 transitions. Word has length 158 [2022-11-23 13:56:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:02,958 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 1817 transitions. [2022-11-23 13:56:02,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2022-11-23 13:56:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1817 transitions. [2022-11-23 13:56:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-23 13:56:02,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:02,962 INFO L195 NwaCegarLoop]: 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, 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] [2022-11-23 13:56:02,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 13:56:03,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-23 13:56:03,169 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:56:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:03,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1463275868, now seen corresponding path program 1 times [2022-11-23 13:56:03,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:03,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516344823] [2022-11-23 13:56:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-23 13:56:03,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:03,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516344823] [2022-11-23 13:56:03,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516344823] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:56:03,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934501692] [2022-11-23 13:56:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:03,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:56:03,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:56:03,351 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:56:03,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 13:56:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:03,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 13:56:03,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:56:03,559 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-23 13:56:03,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:56:03,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934501692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:03,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:56:03,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-23 13:56:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544851899] [2022-11-23 13:56:03,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:03,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 13:56:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:03,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 13:56:03,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 13:56:03,562 INFO L87 Difference]: Start difference. First operand 1620 states and 1817 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2022-11-23 13:56:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:03,950 INFO L93 Difference]: Finished difference Result 2973 states and 3336 transitions. [2022-11-23 13:56:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:56:03,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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 159 [2022-11-23 13:56:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:03,955 INFO L225 Difference]: With dead ends: 2973 [2022-11-23 13:56:03,955 INFO L226 Difference]: Without dead ends: 1631 [2022-11-23 13:56:03,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:56:03,962 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 68 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:03,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 376 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:56:03,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-11-23 13:56:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1584. [2022-11-23 13:56:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1231 states have (on average 1.1039805036555645) internal successors, (1359), 1243 states have internal predecessors, (1359), 178 states have call successors, (178), 160 states have call predecessors, (178), 174 states have return successors, (212), 180 states have call predecessors, (212), 178 states have call successors, (212) [2022-11-23 13:56:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 1749 transitions. [2022-11-23 13:56:04,330 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 1749 transitions. Word has length 159 [2022-11-23 13:56:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:04,330 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 1749 transitions. [2022-11-23 13:56:04,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2022-11-23 13:56:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1749 transitions. [2022-11-23 13:56:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-23 13:56:04,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:04,335 INFO L195 NwaCegarLoop]: 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, 1] [2022-11-23 13:56:04,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 13:56:04,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:56:04,542 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:56:04,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2072401531, now seen corresponding path program 1 times [2022-11-23 13:56:04,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:04,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964862304] [2022-11-23 13:56:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-23 13:56:04,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:04,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964862304] [2022-11-23 13:56:04,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964862304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:56:04,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272884132] [2022-11-23 13:56:04,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:04,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:56:04,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:56:04,781 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:56:04,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 13:56:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:04,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-23 13:56:04,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:56:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-23 13:56:05,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:56:05,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272884132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:05,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 13:56:05,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-23 13:56:05,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968614726] [2022-11-23 13:56:05,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:05,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:56:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:05,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:56:05,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:56:05,017 INFO L87 Difference]: Start difference. First operand 1584 states and 1749 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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) [2022-11-23 13:56:05,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:05,394 INFO L93 Difference]: Finished difference Result 2048 states and 2262 transitions. [2022-11-23 13:56:05,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 13:56:05,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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 160 [2022-11-23 13:56:05,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:05,396 INFO L225 Difference]: With dead ends: 2048 [2022-11-23 13:56:05,396 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 13:56:05,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:56:05,398 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 145 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:05,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 207 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:56:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 13:56:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 13:56:05,400 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) [2022-11-23 13:56:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 13:56:05,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2022-11-23 13:56:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:05,400 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 13:56:05,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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) [2022-11-23 13:56:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 13:56:05,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 13:56:05,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-23 13:56:05,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-23 13:56:05,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 13:56:05,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-23 13:56:05,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 13:56:31,632 WARN L233 SmtUtils]: Spent 14.97s on a formula simplification. DAG size of input: 516 DAG size of output: 466 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 13:56:53,414 WARN L233 SmtUtils]: Spent 15.12s on a formula simplification. DAG size of input: 516 DAG size of output: 466 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-23 13:57:42,913 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 611 DAG size of output: 165 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-23 13:57:48,626 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 771 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-23 13:58:04,045 WARN L233 SmtUtils]: Spent 7.06s on a formula simplification. DAG size of input: 597 DAG size of output: 191 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-23 13:58:10,350 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 561 DAG size of output: 177 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-23 13:58:33,787 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 655 DAG size of output: 171 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-23 13:58:33,792 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 1029 1039) no Hoare annotation was computed. [2022-11-23 13:58:33,793 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 1029 1039) the Hoare annotation is: (let ((.cse39 (= 0 ~t2_st~0)) (.cse0 (+ ~local~0 1)) (.cse14 (= |old(~m_st~0)| 0)) (.cse28 (= ~m_pc~0 1)) (.cse41 (= ~t1_pc~0 1)) (.cse42 (<= 2 ~E_1~0)) (.cse16 (= ~t1_i~0 1)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse43 (= ~t2_pc~0 1)) (.cse21 (= ~t2_i~0 1)) (.cse22 (= ~c_dr_pc~0 0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse20 (= |old(~t2_st~0)| ~t2_st~0)) (.cse38 (= ~t1_st~0 0))) (let ((.cse27 (and .cse18 .cse20 .cse38)) (.cse3 (and .cse41 .cse42 .cse16 .cse17 .cse18 .cse19 .cse20 .cse43 .cse21 .cse22)) (.cse25 (not (= 2 |old(~t2_st~0)|))) (.cse29 (and .cse41 .cse42 .cse16 .cse17 (not .cse28) .cse18 .cse19 .cse20 .cse43 .cse21 .cse22)) (.cse9 (not .cse43)) (.cse10 (not .cse42)) (.cse12 (= ~E_M~0 1)) (.cse31 (and (not .cse14) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse32 (not (= ~E_1~0 2))) (.cse33 (not (<= .cse0 ~token~0))) (.cse8 (not (= 2 |old(~m_st~0)|))) (.cse34 (not (<= ~token~0 .cse0))) (.cse26 (not (= |old(~t1_st~0)| 0))) (.cse30 (not (= ~t1_pc~0 0))) (.cse1 (not .cse21)) (.cse13 (not (= ~E_M~0 2))) (.cse15 (not (<= ~token~0 ~local~0))) (.cse35 (not (= |old(~t2_st~0)| 0))) (.cse2 (not .cse41)) (.cse40 (not (= ~m_pc~0 0))) (.cse4 (not .cse16)) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse23 (not (<= ~local~0 ~token~0))) (.cse36 (and .cse17 .cse18 .cse39)) (.cse6 (not .cse19)) (.cse24 (not (= ~E_1~0 1))) (.cse7 (not (= |old(~t1_st~0)| 2))) (.cse37 (not (= 0 ~t2_pc~0))) (.cse11 (not (<= 2 ~E_2~0)))) (and (or (not (< .cse0 ~token~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (<= ~token~0 (+ 2 ~local~0))) (not .cse12)) (or .cse1 .cse13 .cse14 .cse15 .cse2 .cse4 .cse5 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23 .cse6 .cse24 .cse7 .cse9 .cse25 .cse11) (or .cse26 .cse1 .cse27 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11) (or .cse26 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse13 .cse14 .cse15 .cse27 .cse4 .cse5 .cse30 .cse23 .cse6 .cse24 .cse9 .cse25 .cse11) (or .cse1 .cse31 .cse2 .cse3 .cse32 .cse4 .cse5 .cse33 .cse6 .cse8 .cse9 .cse25 .cse10 .cse34) (or .cse1 .cse35 .cse2 .cse4 .cse5 .cse28 .cse36 .cse6 .cse37 .cse8 .cse10 .cse12) (or .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse35 .cse31 .cse2 .cse32 .cse4 .cse5 .cse33 .cse36 .cse6 .cse37 .cse8 .cse34) (or .cse26 .cse1 .cse13 .cse14 .cse15 .cse35 (and .cse18 .cse38 .cse39) .cse40 .cse4 .cse5 .cse30 .cse23 .cse6 .cse24 .cse37 .cse11) (or .cse1 .cse13 .cse14 .cse15 .cse35 .cse2 .cse40 .cse4 .cse5 .cse23 .cse36 .cse6 .cse24 .cse7 .cse37 .cse11)))) [2022-11-23 13:58:33,793 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 1029 1039) no Hoare annotation was computed. [2022-11-23 13:58:33,794 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2022-11-23 13:58:33,794 INFO L902 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 262 276) the Hoare annotation is: true [2022-11-23 13:58:33,795 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 995 1028) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 1)) (.cse2 (= |old(~m_st~0)| 0))) (let ((.cse48 (= 0 ~t2_pc~0)) (.cse49 (= 0 ~t2_st~0)) (.cse50 (+ ~local~0 1)) (.cse44 (not .cse2)) (.cse35 (= ~t1_pc~0 1)) (.cse36 (<= 2 ~E_1~0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (not .cse23)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse47 (<= 2 ~E_2~0)) (.cse37 (= ~t2_pc~0 1)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= |old(~t2_st~0)| ~t2_st~0)) (.cse51 (= ~t1_st~0 0))) (let ((.cse22 (and .cse9 .cse11 .cse51)) (.cse34 (and .cse35 .cse36 .cse7 .cse8 .cse40 .cse9 .cse10 .cse11 .cse47 .cse37 .cse12 .cse13)) (.cse19 (not (= 2 |old(~t2_st~0)|))) (.cse27 (and .cse44 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse28 (not (= ~E_1~0 2))) (.cse38 (not (<= .cse50 ~token~0))) (.cse39 (not (<= ~token~0 .cse50))) (.cse31 (and .cse35 .cse36 .cse7 .cse8 .cse40 .cse9 .cse10 .cse11 .cse12 .cse13 .cse48 .cse49)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse33 (and .cse9 .cse51 .cse49)) (.cse29 (not (= ~t1_pc~0 0))) (.cse43 (not (< .cse50 ~token~0))) (.cse26 (and .cse35 .cse36 .cse7 .cse8 .cse9 .cse10 .cse11 .cse47 .cse37 .cse12 .cse13)) (.cse24 (not (= 2 |old(~m_st~0)|))) (.cse18 (not .cse37)) (.cse25 (not .cse36)) (.cse45 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse41 (= ~E_M~0 1)) (.cse0 (not .cse12)) (.cse1 (not (= ~E_M~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse30 (not (= |old(~t2_st~0)| 0))) (.cse4 (not .cse35)) (.cse42 (not (= ~m_pc~0 0))) (.cse5 (not .cse7)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse14 (not (<= ~local~0 ~token~0))) (.cse46 (and .cse8 .cse9 .cse49)) (.cse15 (not .cse10)) (.cse16 (not (= ~E_1~0 1))) (.cse17 (not (= |old(~t1_st~0)| 2))) (.cse32 (not .cse48)) (.cse20 (not .cse47))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse22 .cse5 .cse6 .cse23 .cse15 .cse24 .cse18 .cse25 .cse20) (or .cse0 .cse26 .cse27 .cse4 .cse28 .cse5 .cse6 .cse15 .cse17 .cse24 .cse18 .cse19 .cse25 .cse20) (or .cse21 (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse22 .cse5 .cse6 .cse29 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20) (or .cse0 .cse30 .cse4 .cse5 .cse6 .cse23 .cse31 .cse15 .cse32 .cse24 .cse25 .cse20) (or .cse21 .cse0 .cse30 .cse33 .cse5 .cse6 .cse23 .cse15 .cse32 .cse24 .cse25 .cse20) (or .cse0 .cse4 .cse5 .cse6 .cse34 .cse23 .cse15 .cse24 .cse18 .cse25 .cse20) (or .cse0 .cse27 .cse4 (and .cse35 .cse36 .cse7 .cse8 .cse9 .cse10 .cse11 .cse37 .cse12 .cse13) .cse28 .cse5 .cse6 .cse38 .cse15 .cse24 .cse18 .cse19 .cse25 .cse39) (or .cse0 .cse4 .cse5 .cse6 .cse23 .cse15 (and .cse35 .cse36 .cse7 .cse8 .cse40 .cse9 .cse10 .cse11 .cse37 .cse12 .cse13) .cse24 .cse18 .cse25 .cse41) (or .cse21 .cse0 .cse1 .cse3 .cse30 .cse27 .cse33 .cse42 .cse28 .cse5 .cse6 .cse29 .cse14 .cse15 .cse32 .cse20) (or .cse0 .cse1 .cse4 .cse42 .cse5 .cse6 .cse34 .cse23 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20) (or .cse43 .cse0 .cse1 .cse26 .cse4 .cse5 .cse6 .cse15 .cse44 .cse17 .cse18 .cse19 .cse25 .cse20 .cse45) (or .cse0 .cse30 .cse27 .cse4 .cse28 .cse5 .cse6 .cse38 .cse46 .cse15 .cse32 .cse24 .cse39) (or .cse0 .cse30 .cse4 .cse5 .cse6 .cse23 .cse31 .cse15 .cse32 .cse24 .cse25 .cse41) (or .cse21 .cse0 .cse1 .cse2 .cse3 .cse30 .cse33 .cse42 .cse5 .cse6 .cse29 .cse14 .cse15 .cse16 .cse32 .cse20) (or .cse43 .cse0 .cse26 .cse4 .cse5 .cse6 .cse15 .cse17 .cse24 .cse18 .cse25 .cse20 .cse45 (not .cse41)) (or .cse0 .cse1 .cse2 .cse3 .cse30 .cse4 .cse42 .cse5 .cse6 .cse14 .cse46 .cse15 .cse16 .cse17 .cse32 .cse20))))) [2022-11-23 13:58:33,795 INFO L899 garLoopResultBuilder]: For program point L783(lines 783 792) no Hoare annotation was computed. [2022-11-23 13:58:33,795 INFO L899 garLoopResultBuilder]: For program point L783-2(lines 783 792) no Hoare annotation was computed. [2022-11-23 13:58:33,795 INFO L899 garLoopResultBuilder]: For program point L746(lines 746 751) no Hoare annotation was computed. [2022-11-23 13:58:33,796 INFO L895 garLoopResultBuilder]: At program point L775(lines 763 777) the Hoare annotation is: (let ((.cse37 (= ~E_M~0 1)) (.cse31 (= ~m_pc~0 1)) (.cse45 (= |old(~m_st~0)| 0))) (let ((.cse43 (not .cse45)) (.cse54 (+ ~local~0 1)) (.cse57 (= ~t1_st~0 0)) (.cse26 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse20 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse21 (= ~t1_pc~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (not (= ~m_pc~0 ~t1_pc~0))) (.cse55 (= ~m_st~0 2)) (.cse13 (= ~t1_i~0 1)) (.cse14 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (not .cse31)) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= |old(~t2_st~0)| ~t2_st~0)) (.cse28 (= ~t2_i~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse56 (= 0 ~t2_pc~0)) (.cse19 (= 0 ~t2_st~0)) (.cse53 (not .cse37))) (let ((.cse0 (and .cse21 .cse22 .cse23 .cse55 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse28 .cse18 .cse56 .cse19 .cse53)) (.cse41 (and .cse21 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse26 .cse27 .cse28 .cse18 .cse20)) (.cse39 (and .cse14 .cse16 .cse25 .cse57 .cse20)) (.cse42 (not (< .cse54 ~token~0))) (.cse40 (and .cse21 .cse22 .cse23 .cse55 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse26 .cse27 .cse28 .cse18)) (.cse44 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse49 (not (= ~E_1~0 1))) (.cse32 (not (= |old(~t1_st~0)| 2))) (.cse52 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse29 (not (= ~E_M~0 2))) (.cse46 (not (<= ~token~0 ~local~0))) (.cse30 (not (= ~m_pc~0 0))) (.cse47 (not (= ~t1_pc~0 0))) (.cse48 (not (<= ~local~0 ~token~0))) (.cse38 (not (= |old(~t1_st~0)| 0))) (.cse50 (and .cse14 .cse16 .cse57 .cse19 .cse20)) (.cse2 (not (= |old(~t2_st~0)| 0))) (.cse10 (not .cse56)) (.cse36 (not .cse26)) (.cse1 (not .cse28)) (.cse3 (and .cse43 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse4 (not .cse21)) (.cse5 (not (= ~E_1~0 2))) (.cse6 (not .cse13)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (<= .cse54 ~token~0))) (.cse9 (not .cse17)) (.cse51 (and .cse21 .cse22 .cse23 .cse55 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse27 .cse28 .cse18 .cse53)) (.cse11 (not (= 2 |old(~m_st~0)|))) (.cse33 (not .cse27)) (.cse34 (not (= 2 |old(~t2_st~0)|))) (.cse35 (not .cse22)) (.cse12 (not (<= ~token~0 .cse54)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse1 (and .cse21 .cse22 .cse23 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse26 .cse27 .cse28 .cse18 .cse20) .cse29 .cse4 .cse30 .cse6 .cse7 .cse31 .cse9 .cse32 .cse33 .cse34 .cse35 .cse36) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse35 .cse37) (or .cse21 .cse38 .cse1 .cse6 .cse7 .cse31 .cse9 .cse39 .cse11 .cse33 .cse35 .cse36) (or .cse1 .cse4 .cse6 .cse7 .cse31 .cse9 .cse40 .cse11 .cse33 .cse35 .cse36) (or .cse1 .cse41 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse32 .cse40 .cse11 .cse33 .cse34 .cse35 .cse36) (or .cse42 .cse1 .cse29 .cse41 .cse4 .cse6 .cse7 .cse9 .cse43 .cse32 .cse33 .cse34 .cse35 .cse36 .cse44) (or .cse38 .cse23 .cse1 .cse29 .cse45 .cse46 .cse6 .cse7 .cse47 .cse48 .cse9 .cse49 .cse39 .cse33 .cse34 .cse36) (or .cse38 .cse1 .cse50 .cse29 .cse45 .cse46 .cse2 .cse30 .cse6 .cse7 .cse47 .cse48 .cse9 .cse49 .cse10 .cse36) (or .cse1 .cse4 .cse6 .cse7 .cse31 .cse9 .cse51 .cse11 .cse33 .cse35 .cse37) (or .cse1 .cse29 .cse45 .cse46 .cse4 .cse6 .cse7 .cse48 .cse9 .cse49 .cse32 .cse33 .cse34 .cse36 (and .cse52 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18)) (or .cse42 .cse1 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) (= ~m_st~0 0) (= 2 ~t1_st~0) .cse25 .cse20) .cse4 .cse6 .cse7 .cse9 .cse32 .cse40 .cse11 .cse33 .cse35 .cse36 .cse44 .cse53) (or .cse1 .cse29 .cse45 .cse46 .cse2 .cse4 .cse30 .cse6 .cse7 .cse48 .cse9 .cse49 .cse32 (and .cse52 .cse23 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19) .cse10 .cse36) (or .cse38 .cse1 .cse50 .cse29 .cse46 .cse2 .cse3 .cse30 .cse5 .cse6 .cse7 .cse47 .cse48 .cse9 .cse10 .cse36) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse31 (and .cse23 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19) .cse9 .cse10 .cse11 .cse35 .cse36) (or .cse21 .cse38 .cse1 .cse50 .cse2 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse35 .cse36) (or .cse1 (and .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse28 .cse18 .cse20) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse51 .cse11 .cse33 .cse34 .cse35 .cse12))))) [2022-11-23 13:58:33,796 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 789) no Hoare annotation was computed. [2022-11-23 13:58:33,796 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 773) no Hoare annotation was computed. [2022-11-23 13:58:33,796 INFO L899 garLoopResultBuilder]: For program point L764-2(lines 764 773) no Hoare annotation was computed. [2022-11-23 13:58:33,797 INFO L895 garLoopResultBuilder]: At program point L756(lines 744 758) the Hoare annotation is: (let ((.cse4 (= ~m_pc~0 1)) (.cse13 (= |old(~m_st~0)| 0))) (let ((.cse47 (not .cse13)) (.cse49 (<= 2 ~E_2~0)) (.cse31 (= ~t2_pc~0 1)) (.cse22 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~E_1~0)) (.cse24 (= ~t1_i~0 1)) (.cse27 (not .cse4)) (.cse29 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse30 (= |old(~t2_st~0)| ~t2_st~0)) (.cse32 (= ~t2_i~0 1)) (.cse33 (= ~c_dr_pc~0 0)) (.cse52 (= 0 ~t2_pc~0)) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse50 (+ ~local~0 1)) (.cse25 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse51 (= ~t1_st~0 0)) (.cse43 (= 0 ~t2_st~0))) (let ((.cse16 (and .cse25 .cse28 .cse51 .cse43)) (.cse18 (not (= ~t1_pc~0 0))) (.cse38 (not (<= .cse50 ~token~0))) (.cse39 (not (<= ~token~0 .cse50))) (.cse35 (and .cse25 .cse26 .cse28 .cse43)) (.cse15 (not (= |old(~t2_st~0)| 0))) (.cse40 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse52 .cse43)) (.cse21 (not .cse52)) (.cse14 (not (<= ~token~0 ~local~0))) (.cse19 (not (<= ~local~0 ~token~0))) (.cse20 (not (= ~E_1~0 1))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse41 (and .cse25 .cse28 .cse30 .cse51)) (.cse46 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse49 .cse31 .cse33)) (.cse36 (and .cse47 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse37 (not (= ~E_1~0 2))) (.cse45 (not (< .cse50 ~token~0))) (.cse6 (not (= 2 |old(~m_st~0)|))) (.cse9 (and .cse22 .cse23 (= ~m_st~0 2) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse49 .cse31 .cse32 .cse33)) (.cse48 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse34 (= ~E_M~0 1)) (.cse0 (not .cse32)) (.cse12 (not (= ~E_M~0 2))) (.cse1 (not .cse22)) (.cse17 (not (= ~m_pc~0 0))) (.cse2 (not .cse24)) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse5 (not .cse29)) (.cse44 (not (= |old(~t1_st~0)| 2))) (.cse7 (not .cse31)) (.cse42 (not (= 2 |old(~t2_st~0)|))) (.cse8 (not .cse23)) (.cse10 (not .cse49))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse2 .cse3 .cse18 .cse19 .cse5 .cse20 .cse21 .cse10) (or .cse0 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse34) (or .cse0 .cse35 .cse15 .cse36 .cse1 .cse37 .cse2 .cse3 .cse38 .cse5 .cse21 .cse6 .cse39) (or .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse6 .cse8 .cse34) (or .cse11 (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse12 .cse13 .cse14 .cse2 .cse3 .cse18 .cse19 .cse41 .cse5 .cse20 .cse7 .cse42 .cse10) (or .cse11 .cse0 .cse12 .cse14 .cse15 .cse36 .cse16 .cse17 .cse37 .cse2 .cse3 .cse18 .cse19 .cse5 .cse21 .cse10) (or .cse0 .cse36 .cse1 .cse37 .cse2 .cse3 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse33) .cse38 .cse5 .cse6 .cse7 .cse42 .cse8 .cse39) (or .cse11 .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse43) .cse21 .cse6 .cse8 .cse10) (or .cse0 .cse35 .cse12 .cse13 .cse14 .cse15 .cse1 .cse17 .cse2 .cse3 .cse19 .cse5 .cse20 .cse44 .cse21 .cse10) (or .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse6 .cse8 .cse10) (or .cse0 .cse12 .cse13 .cse14 .cse1 .cse2 .cse3 .cse19 .cse5 .cse20 .cse44 (and .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse33) .cse7 .cse42 .cse10) (or .cse45 .cse0 .cse12 .cse46 .cse1 .cse2 .cse3 .cse5 .cse47 .cse44 .cse7 .cse42 .cse8 .cse10 .cse48) (or .cse11 .cse0 .cse2 .cse3 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse46 .cse36 .cse1 .cse37 .cse2 .cse3 .cse5 .cse44 .cse6 .cse7 .cse42 .cse8 .cse10) (or .cse45 .cse0 .cse1 .cse2 .cse3 (and .cse22 .cse23 (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse24 .cse26 .cse28 .cse29 .cse30 .cse49 .cse31 .cse33) .cse5 .cse44 .cse6 .cse7 .cse8 .cse9 .cse10 .cse48 (not .cse34)) (or .cse0 .cse12 .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse44 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse49 .cse31 .cse32 .cse33) .cse7 .cse42 .cse8 .cse10))))) [2022-11-23 13:58:33,797 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 770) no Hoare annotation was computed. [2022-11-23 13:58:33,797 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 995 1028) no Hoare annotation was computed. [2022-11-23 13:58:33,798 INFO L895 garLoopResultBuilder]: At program point L794(lines 782 796) the Hoare annotation is: (let ((.cse26 (= ~E_M~0 1)) (.cse23 (= ~m_pc~0 1)) (.cse36 (= |old(~m_st~0)| 0))) (let ((.cse55 (<= 2 ~E_2~0)) (.cse60 (= 0 ~t2_pc~0)) (.cse44 (not .cse36)) (.cse59 (+ ~local~0 1)) (.cse48 (= 0 ~t2_st~0)) (.cse41 (= ~t1_st~0 0)) (.cse57 (= ~t1_pc~0 1)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse58 (= ~m_st~0 2)) (.cse3 (not .cse23)) (.cse56 (= ~t2_pc~0 1)) (.cse54 (not .cse26)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse27 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (= |old(~t2_st~0)| ~t2_st~0)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse30 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0))) (let ((.cse13 (and .cse0 .cse2 .cse27 .cse28 .cse40 .cse29 .cse4 .cse5 .cse6 .cse7 .cse30)) (.cse31 (and .cse57 .cse0 .cse1 .cse58 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse56 .cse6 .cse7 .cse54)) (.cse49 (and .cse57 .cse2 .cse28 .cse3 .cse4 .cse41 .cse7)) (.cse34 (not (= |old(~t1_st~0)| 0))) (.cse50 (not (= ~m_pc~0 0))) (.cse38 (not (= ~t1_pc~0 0))) (.cse52 (and .cse27 .cse40 .cse29 .cse41 .cse48 .cse30)) (.cse43 (not (< .cse59 ~token~0))) (.cse45 (= ~m_st~0 0)) (.cse46 (= 2 ~t1_st~0)) (.cse47 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse22 (not (= |old(~t2_st~0)| 0))) (.cse9 (and .cse44 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse11 (not (= ~E_1~0 2))) (.cse32 (not (<= .cse59 ~token~0))) (.cse24 (and .cse57 .cse0 .cse1 .cse58 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse60 .cse48 .cse54)) (.cse25 (not .cse60)) (.cse33 (not (<= ~token~0 .cse59))) (.cse53 (and .cse57 .cse0 .cse1 .cse58 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse55 .cse56 .cse6 .cse7)) (.cse17 (not (= 2 |old(~m_st~0)|))) (.cse20 (not .cse0)) (.cse8 (not .cse6)) (.cse51 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse35 (not (= ~E_M~0 2))) (.cse37 (not (<= ~token~0 ~local~0))) (.cse10 (not .cse57)) (.cse12 (not .cse2)) (.cse14 (not (= ~p_dw_pc~0 0))) (.cse39 (not (<= ~local~0 ~token~0))) (.cse15 (not .cse4)) (.cse42 (not (= ~E_1~0 1))) (.cse16 (not (= |old(~t1_st~0)| 2))) (.cse18 (not .cse56)) (.cse19 (not (= 2 |old(~t2_st~0)|))) (.cse21 (not .cse55))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse8 .cse22 .cse10 .cse12 .cse14 .cse23 .cse15 .cse24 .cse25 .cse17 .cse20 .cse26) (or (and .cse0 .cse2 .cse27 .cse28 .cse29 .cse4 .cse5 .cse6 .cse7 (<= 1 |activate_threads2_is_transmit2_triggered_~__retres1~6#1|) .cse30) .cse8 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse15 .cse17 .cse18 .cse19 .cse20 .cse33) (or .cse34 .cse1 .cse8 .cse35 .cse36 .cse37 .cse12 .cse14 .cse38 .cse39 (and .cse27 .cse40 .cse29 .cse5 .cse41 .cse30) .cse15 .cse42 .cse18 .cse19 .cse21) (or .cse43 .cse8 .cse35 .cse10 .cse12 .cse14 .cse15 .cse44 .cse16 .cse18 .cse19 .cse20 (and .cse0 .cse2 .cse27 .cse40 .cse45 .cse46 .cse4 .cse5 .cse6 .cse7 .cse30) .cse21 .cse47) (or .cse34 .cse8 (and .cse27 .cse29 .cse41 .cse48 .cse30) .cse49 .cse22 .cse12 .cse14 .cse23 .cse15 .cse25 .cse17 .cse20 .cse21) (or .cse8 .cse35 .cse10 .cse50 .cse12 .cse14 .cse23 .cse15 .cse16 (and .cse0 .cse1 .cse2 .cse27 .cse28 .cse40 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse30) .cse18 .cse19 .cse20 .cse21) (or .cse8 .cse31 .cse10 .cse12 .cse14 .cse23 .cse15 .cse17 .cse18 .cse20 .cse26) (or .cse8 .cse35 .cse36 .cse37 .cse22 .cse10 .cse50 .cse12 .cse14 .cse39 .cse15 .cse42 .cse16 (and .cse51 .cse27 .cse40 .cse29 .cse41 .cse48) .cse25 .cse21) (or .cse34 .cse8 .cse35 .cse37 .cse22 .cse9 .cse50 .cse11 .cse12 .cse14 .cse38 .cse39 .cse15 .cse25 .cse52 .cse21) (or .cse34 .cse8 .cse49 .cse12 .cse14 .cse23 .cse15 .cse17 .cse18 (and .cse27 .cse28 .cse29 .cse5 .cse30) .cse20 .cse21) (or .cse8 .cse22 (and .cse1 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse48) .cse10 .cse12 .cse14 .cse23 .cse15 .cse25 .cse17 .cse20 .cse21) (or .cse34 .cse8 .cse35 .cse36 .cse37 .cse22 .cse50 .cse12 .cse14 .cse38 .cse39 .cse15 .cse42 .cse25 .cse52 .cse21) (or .cse43 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse40 .cse45 .cse46 .cse5 .cse30) .cse8 .cse53 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse47 .cse54) (or .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse32 .cse15 .cse24 .cse25 .cse17 .cse33 (and .cse27 .cse28 .cse40 .cse29 .cse48 .cse30)) (or .cse8 .cse53 .cse10 .cse12 .cse14 .cse23 .cse15 .cse17 .cse18 .cse20 .cse21) (or .cse8 (and .cse51 .cse27 .cse40 .cse29 .cse5 .cse41) .cse35 .cse36 .cse37 .cse10 .cse12 .cse14 .cse39 .cse15 .cse42 .cse16 .cse18 .cse19 .cse21))))) [2022-11-23 13:58:33,798 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 754) no Hoare annotation was computed. [2022-11-23 13:58:33,798 INFO L899 garLoopResultBuilder]: For program point L745-2(lines 745 754) no Hoare annotation was computed. [2022-11-23 13:58:33,799 INFO L902 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 387 411) the Hoare annotation is: true [2022-11-23 13:58:33,799 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2022-11-23 13:58:33,799 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2022-11-23 13:58:33,799 INFO L902 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: true [2022-11-23 13:58:33,799 INFO L902 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: true [2022-11-23 13:58:33,799 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2022-11-23 13:58:33,800 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 798 805) no Hoare annotation was computed. [2022-11-23 13:58:33,800 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 798 805) the Hoare annotation is: true [2022-11-23 13:58:33,800 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 919 956) the Hoare annotation is: (let ((.cse24 (= ~t2_pc~0 1)) (.cse22 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse21 (= ~t1_i~0 1)) (.cse19 (= ~t1_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse33 (= ~t2_i~0 1)) (.cse18 (not (= ~m_st~0 0))) (.cse20 (<= 2 ~E_1~0)) (.cse25 (<= |old(~E_2~0)| ~E_2~0)) (.cse34 (not (= ~E_M~0 1)))) (let ((.cse9 (and .cse20 .cse25 .cse34)) (.cse10 (not (= 0 ~t2_st~0))) (.cse12 (not (= 0 ~t2_pc~0))) (.cse13 (not (= ~t1_st~0 0))) (.cse29 (not (= 2 |old(~E_1~0)|))) (.cse8 (not (= ~m_st~0 2))) (.cse31 (= ~E_1~0 2)) (.cse30 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse18)) (.cse0 (not (<= 2 |old(~E_2~0)|))) (.cse1 (not .cse33)) (.cse32 (not .cse6)) (.cse23 (<= 2 ~E_2~0)) (.cse26 (= ~c_dr_pc~0 0)) (.cse27 (= ~E_1~0 |old(~E_1~0)|)) (.cse28 (= ~E_M~0 2)) (.cse2 (not .cse19)) (.cse15 (not (= 2 ~t2_st~0))) (.cse16 (not (= 2 |old(~E_M~0)|))) (.cse3 (not .cse21)) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse17 (not (= 2 ~t1_st~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (= |old(~E_M~0)| 1)) (.cse11 (not .cse22)) (.cse14 (not .cse24))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (< (+ ~local~0 1) ~token~0)) .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse7 .cse11 .cse18 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse14 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 (not (<= ~token~0 ~local~0)) .cse29 .cse16 .cse3 .cse4 (not (= ~t1_pc~0 0)) (not (<= ~local~0 ~token~0)) .cse10 .cse11 .cse12 .cse30 .cse13 (and .cse25 .cse28 .cse31)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 (and .cse19 .cse20 .cse21 .cse32 .cse22 .cse23 .cse24 .cse25 .cse33 .cse26 .cse34) .cse14) (or .cse0 .cse1 .cse2 .cse29 .cse15 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse31) .cse11 .cse30 .cse14) (or .cse0 .cse1 (and .cse19 .cse20 .cse21 .cse32 .cse22 .cse23 .cse24 .cse25 .cse33 .cse26 .cse27 .cse28 .cse34) .cse2 (not (= ~m_pc~0 0)) .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse11 .cse14)))) [2022-11-23 13:58:33,800 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 919 956) no Hoare annotation was computed. [2022-11-23 13:58:33,801 INFO L902 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 315 332) the Hoare annotation is: true [2022-11-23 13:58:33,801 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2022-11-23 13:58:33,801 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 99 127) the Hoare annotation is: true [2022-11-23 13:58:33,801 INFO L902 garLoopResultBuilder]: At program point L124(lines 102 126) the Hoare annotation is: true [2022-11-23 13:58:33,801 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2022-11-23 13:58:33,801 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2022-11-23 13:58:33,802 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2022-11-23 13:58:33,802 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2022-11-23 13:58:33,802 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2022-11-23 13:58:33,802 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2022-11-23 13:58:33,802 INFO L895 garLoopResultBuilder]: At program point L861(line 861) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse22 (= ~m_st~0 0)) (.cse30 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 0)) (.cse28 (not (= ~E_M~0 1))) (.cse14 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse24 (= ~m_st~0 2)) (.cse25 (<= ~token~0 .cse30)) (.cse26 (<= .cse30 ~token~0)) (.cse29 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (or .cse2 .cse22)) (.cse4 (= ~t1_st~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2)) (.cse15 (= ~t1_pc~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse1 (= ~t1_i~0 1)) (.cse17 (= 2 ~t2_st~0)) (.cse27 (not (= ~m_pc~0 1))) (.cse18 (= 2 ~t1_st~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse19 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse23 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9) (and .cse15 .cse1 .cse17 .cse3 .cse21 .cse4 .cse5 .cse19 (not .cse22) .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse23) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse24 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse24 .cse1 .cse18 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse29 .cse17 .cse22 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse17 .cse22 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 (< .cse30 ~token~0) .cse9) (and .cse15 .cse1 .cse2 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse13) (and .cse15 .cse1 .cse22 .cse18 .cse3 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse19 .cse26 .cse6 .cse7 .cse9 .cse10 .cse13 .cse23) (and .cse1 .cse29 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse16 .cse1 .cse17 .cse22 .cse27 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse23)))) [2022-11-23 13:58:33,803 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-11-23 13:58:33,803 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2022-11-23 13:58:33,803 INFO L895 garLoopResultBuilder]: At program point L730(line 730) the Hoare annotation is: (let ((.cse3 (not (= ~m_pc~0 1))) (.cse9 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~t1_st~0 0) .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 (< (+ ~local~0 1) ~token~0) (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0))) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (= ~E_M~0 1)))) [2022-11-23 13:58:33,803 INFO L899 garLoopResultBuilder]: For program point L730-1(line 730) no Hoare annotation was computed. [2022-11-23 13:58:33,803 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 496 536) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,804 INFO L895 garLoopResultBuilder]: At program point L1127(line 1127) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-23 13:58:33,804 INFO L895 garLoopResultBuilder]: At program point L1127-1(line 1127) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-23 13:58:33,804 INFO L899 garLoopResultBuilder]: For program point L863(line 863) no Hoare annotation was computed. [2022-11-23 13:58:33,804 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2022-11-23 13:58:33,804 INFO L895 garLoopResultBuilder]: At program point L599(line 599) the Hoare annotation is: false [2022-11-23 13:58:33,805 INFO L895 garLoopResultBuilder]: At program point L1128(line 1128) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-23 13:58:33,805 INFO L895 garLoopResultBuilder]: At program point L633(lines 628 667) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~t1_i~0 1) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~E_2~0) (= ~t2_pc~0 1) (not (= ~m_st~0 0)) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (< (+ ~local~0 1) ~token~0) (= ~E_M~0 2) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) [2022-11-23 13:58:33,805 INFO L895 garLoopResultBuilder]: At program point L898(lines 860 912) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse22 (= ~m_st~0 0)) (.cse30 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 0)) (.cse28 (not (= ~E_M~0 1))) (.cse14 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse24 (= ~m_st~0 2)) (.cse25 (<= ~token~0 .cse30)) (.cse26 (<= .cse30 ~token~0)) (.cse29 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (or .cse2 .cse22)) (.cse4 (= ~t1_st~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2)) (.cse15 (= ~t1_pc~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse1 (= ~t1_i~0 1)) (.cse17 (= 2 ~t2_st~0)) (.cse27 (not (= ~m_pc~0 1))) (.cse18 (= 2 ~t1_st~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse19 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse23 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9) (and .cse15 .cse1 .cse17 .cse3 .cse21 .cse4 .cse5 .cse19 (not .cse22) .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse23) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse24 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse24 .cse1 .cse18 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse29 .cse17 .cse22 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse17 .cse22 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 (< .cse30 ~token~0) .cse9) (and .cse15 .cse1 .cse2 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse13) (and .cse15 .cse1 .cse22 .cse18 .cse3 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse19 .cse26 .cse6 .cse7 .cse9 .cse10 .cse13 .cse23) (and .cse1 .cse29 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse16 .cse1 .cse17 .cse22 .cse27 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse23)))) [2022-11-23 13:58:33,805 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 869) no Hoare annotation was computed. [2022-11-23 13:58:33,806 INFO L899 garLoopResultBuilder]: For program point L865-1(lines 860 912) no Hoare annotation was computed. [2022-11-23 13:58:33,806 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,806 INFO L899 garLoopResultBuilder]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2022-11-23 13:58:33,806 INFO L895 garLoopResultBuilder]: At program point L537(lines 484 542) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2022-11-23 13:58:33,806 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,807 INFO L895 garLoopResultBuilder]: At program point L471-1(line 471) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,807 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2022-11-23 13:58:33,807 INFO L895 garLoopResultBuilder]: At program point L1132-1(lines 1129 1169) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 0)) (.cse3 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 2)) (.cse18 (not (= ~m_pc~0 1))) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse19 (not (= ~E_M~0 1))) (.cse13 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (= ~t1_i~0 1)) (.cse14 (= 2 ~t2_st~0)) (.cse15 (= 2 ~t1_st~0)) (.cse2 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse5 (= ~t2_i~0 1)) (.cse6 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11) (and .cse12 .cse13 .cse0 .cse14 .cse15 .cse2 .cse4 .cse16 .cse5 .cse6 .cse7 .cse9) (and .cse12 .cse13 .cse17 .cse0 .cse18 .cse2 .cse4 .cse16 .cse5 .cse6 .cse19) (and .cse13 .cse17 .cse0 .cse18 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse19) (and .cse13 .cse17 .cse0 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse19) (and .cse12 .cse13 .cse17 .cse0 .cse18 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse19) (and .cse12 .cse13 .cse0 (<= ~token~0 (+ 2 ~local~0)) .cse14 .cse1 .cse15 .cse2 .cse4 .cse16 .cse5 .cse6 (< (+ ~local~0 1) ~token~0) .cse9) (and .cse12 .cse0 (= ~m_st~0 ~E_M~0) .cse14 .cse15 .cse2 .cse4 .cse16 .cse5 .cse6 .cse9 .cse11))) [2022-11-23 13:58:33,807 INFO L899 garLoopResultBuilder]: For program point L901(lines 901 908) no Hoare annotation was computed. [2022-11-23 13:58:33,807 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2022-11-23 13:58:33,807 INFO L899 garLoopResultBuilder]: For program point L870(lines 860 912) no Hoare annotation was computed. [2022-11-23 13:58:33,808 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,808 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2022-11-23 13:58:33,808 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2022-11-23 13:58:33,808 INFO L895 garLoopResultBuilder]: At program point L210(lines 210 214) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= 2 ~p_dw_pc~0))))) [2022-11-23 13:58:33,808 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2022-11-23 13:58:33,808 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,809 INFO L895 garLoopResultBuilder]: At program point L179(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,809 INFO L902 garLoopResultBuilder]: At program point L1170(lines 1117 1175) the Hoare annotation is: true [2022-11-23 13:58:33,809 INFO L895 garLoopResultBuilder]: At program point L1104(line 1104) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-23 13:58:33,809 INFO L895 garLoopResultBuilder]: At program point L1104-1(line 1104) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-23 13:58:33,810 INFO L899 garLoopResultBuilder]: For program point L873(lines 873 880) no Hoare annotation was computed. [2022-11-23 13:58:33,810 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 717) no Hoare annotation was computed. [2022-11-23 13:58:33,810 INFO L895 garLoopResultBuilder]: At program point L676(lines 676 680) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse8 (= 0 ~t2_pc~0)) (.cse9 (= 0 ~t2_st~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (= ~m_st~0 2)) (.cse13 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse2 (= ~t1_i~0 1)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse11 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse14 (= ~E_M~0 2)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse17 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse10) (and .cse12 .cse1 .cse13 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse15 .cse16 .cse17 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (and .cse12 .cse1 .cse13 .cse2 (= 2 ~t2_st~0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))))) [2022-11-23 13:58:33,810 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,810 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,811 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2022-11-23 13:58:33,811 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,811 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse13))) [2022-11-23 13:58:33,811 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-11-23 13:58:33,811 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,812 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2022-11-23 13:58:33,812 INFO L895 garLoopResultBuilder]: At program point L712(lines 712 716) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse3 (= ~t1_i~0 1)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~t1_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~local~0 1))) (and .cse0 .cse2 .cse3 (<= ~token~0 .cse11) (= 2 ~t1_st~0) .cse5 .cse6 .cse7 (<= .cse11 ~token~0) .cse8 .cse9 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0))) (= ~E_M~0 2) (= ~E_1~0 2) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))))) [2022-11-23 13:58:33,812 INFO L895 garLoopResultBuilder]: At program point L646(line 646) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse4 (= 2 ~t1_st~0)) (.cse2 (= 2 ~t2_st~0)) (.cse7 (= ~t2_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~E_1~0 1)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse19 (= ~t1_st~0 0)) (.cse6 (<= 2 ~E_2~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= 0 ~t2_pc~0)) (.cse11 (= ~E_M~0 2)) (.cse16 (= 0 ~t2_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse17 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse14 .cse15 .cse11 .cse16 .cse12 .cse13 .cse17) (and .cse1 .cse18 .cse2 .cse3 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13 .cse17) (and .cse1 .cse18 .cse3 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10 .cse14 .cse15 .cse11 .cse16 .cse12 .cse13 .cse17))) [2022-11-23 13:58:33,812 INFO L899 garLoopResultBuilder]: For program point L646-1(line 646) no Hoare annotation was computed. [2022-11-23 13:58:33,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 13:58:33,813 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-11-23 13:58:33,813 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2022-11-23 13:58:33,813 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 206 260) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2022-11-23 13:58:33,813 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse13))) [2022-11-23 13:58:33,814 INFO L895 garLoopResultBuilder]: At program point L1144-1(line 1144) the Hoare annotation is: (let ((.cse9 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse12 (= 2 ~t2_st~0)) (.cse13 (= 2 ~t1_st~0)) (.cse15 (= ~E_M~0 2)) (.cse5 (= ~t1_st~0 0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse14 (= ~t2_pc~0 1)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 .cse15 (= ~E_1~0 2)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse12 (= ~m_st~0 0) .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (< (+ ~local~0 1) ~token~0) .cse15) (and .cse11 .cse0 .cse2 .cse12 .cse3 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (= ~m_pc~0 0) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8))) [2022-11-23 13:58:33,814 INFO L895 garLoopResultBuilder]: At program point L913(lines 854 918) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse13))) [2022-11-23 13:58:33,814 INFO L895 garLoopResultBuilder]: At program point L1145(line 1145) the Hoare annotation is: (let ((.cse9 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse12 (= 2 ~t2_st~0)) (.cse13 (= 2 ~t1_st~0)) (.cse15 (= ~E_M~0 2)) (.cse5 (= ~t1_st~0 0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse14 (= ~t2_pc~0 1)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 .cse12 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (= ~m_pc~0 0) .cse15) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse12 (= ~m_st~0 0) .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (< (+ ~local~0 1) ~token~0) .cse15) (and .cse11 .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse12 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 .cse15 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8))) [2022-11-23 13:58:33,814 INFO L895 garLoopResultBuilder]: At program point L518(lines 518 527) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,815 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2022-11-23 13:58:33,815 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,815 INFO L895 garLoopResultBuilder]: At program point L1146(line 1146) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-23 13:58:33,815 INFO L895 garLoopResultBuilder]: At program point L684-1(lines 672 703) the Hoare annotation is: (let ((.cse24 (+ ~local~0 1))) (let ((.cse3 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse12 (<= ~token~0 .cse24)) (.cse14 (<= .cse24 ~token~0)) (.cse8 (= 0 ~t2_pc~0)) (.cse9 (= 0 ~t2_st~0)) (.cse20 (<= ~token~0 ~local~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse22 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse0 (<= 2 ~E_1~0)) (.cse18 (= ~m_st~0 0)) (.cse19 (= ~m_pc~0 0)) (.cse1 (= ~m_st~0 2)) (.cse11 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse2 (= ~t1_i~0 1)) (.cse23 (= 2 ~t2_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse13 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse15 (= ~E_M~0 2)) (.cse16 (= ~E_1~0 2)) (.cse17 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse11 .cse2 .cse12 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7 .cse15 .cse9 .cse16 .cse17) (and .cse0 .cse11 (= ~t1_pc~0 0) .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse15 .cse9 .cse20 .cse21 .cse16 .cse22 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse10) (and .cse1 .cse11 .cse2 .cse12 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse15 .cse9 .cse16 .cse22) (and .cse1 .cse11 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse20 .cse21 .cse16 .cse22) (and .cse0 .cse11 .cse2 .cse23 .cse18 .cse4 .cse5 .cse13 .cse6 .cse7 .cse19 .cse15 .cse17) (and .cse1 .cse11 .cse2 .cse23 .cse4 .cse5 .cse13 .cse6 .cse7 .cse15 .cse16 .cse17)))) [2022-11-23 13:58:33,816 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2022-11-23 13:58:33,816 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 13:58:33,816 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2022-11-23 13:58:33,816 INFO L899 garLoopResultBuilder]: For program point L884(lines 860 912) no Hoare annotation was computed. [2022-11-23 13:58:33,816 INFO L899 garLoopResultBuilder]: For program point L1149(line 1149) no Hoare annotation was computed. [2022-11-23 13:58:33,817 INFO L895 garLoopResultBuilder]: At program point L720-1(lines 708 739) the Hoare annotation is: (let ((.cse10 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse20 (+ ~local~0 1)) (.cse11 (= ~m_st~0 0)) (.cse12 (= ~m_pc~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse23 (not .cse10)) (.cse3 (not (= ~m_pc~0 1))) (.cse9 (not (= ~E_M~0 1))) (.cse22 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse5 (= ~t1_st~0 0)) (.cse19 (= ~t1_pc~0 1)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse21 (= 2 ~t1_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse13 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0)))) (.cse14 (= ~E_M~0 2)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse17 (= ~E_1~0 2)) (.cse18 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse10 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse1 .cse2 (<= ~token~0 .cse20) .cse21 .cse4 .cse6 (<= .cse20 ~token~0) .cse7 .cse8 .cse13 .cse14 .cse17 .cse18) (and .cse19 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse11 .cse21 .cse4 .cse6 .cse7 .cse8 (< .cse20 ~token~0) .cse13 .cse14 .cse22) (and .cse19 .cse0 .cse23 .cse2 .cse11 .cse3 .cse21 .cse4 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse19 .cse2 (= ~m_st~0 ~E_M~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse22) (and .cse1 (= ~t1_pc~0 0) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse1 .cse2 .cse21 .cse4 .cse6 .cse7 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2022-11-23 13:58:33,817 INFO L895 garLoopResultBuilder]: At program point L654-1(lines 628 667) the Hoare annotation is: (let ((.cse14 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse20 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse19 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~m_pc~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse11 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse2 .cse20 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse11 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse2 .cse20 .cse3 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse11 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11 .cse12))) [2022-11-23 13:58:33,817 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,817 INFO L895 garLoopResultBuilder]: At program point L522-1(line 522) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,817 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-11-23 13:58:33,818 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2022-11-23 13:58:33,818 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2022-11-23 13:58:33,818 INFO L895 garLoopResultBuilder]: At program point L1151(lines 1151 1160) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-23 13:58:33,818 INFO L899 garLoopResultBuilder]: For program point L1151-2(lines 1151 1160) no Hoare annotation was computed. [2022-11-23 13:58:33,818 INFO L899 garLoopResultBuilder]: For program point L887(lines 887 894) no Hoare annotation was computed. [2022-11-23 13:58:33,819 INFO L895 garLoopResultBuilder]: At program point L161(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1))) (.cse2 (= ~p_dw_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0)) (and .cse0 .cse1 (= ~c_dr_pc~0 1) .cse2))) [2022-11-23 13:58:33,819 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-11-23 13:58:33,819 INFO L895 garLoopResultBuilder]: At program point L492-1(line 492) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-11-23 13:58:33,819 INFO L895 garLoopResultBuilder]: At program point L459(lines 412 464) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,819 INFO L895 garLoopResultBuilder]: At program point L196(lines 153 201) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-11-23 13:58:33,819 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2022-11-23 13:58:33,820 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-11-23 13:58:33,820 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-11-23 13:58:33,820 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2022-11-23 13:58:33,820 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1194) no Hoare annotation was computed. [2022-11-23 13:58:33,820 INFO L895 garLoopResultBuilder]: At program point L1155(line 1155) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-23 13:58:33,821 INFO L895 garLoopResultBuilder]: At program point L1155-1(line 1155) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-11-23 13:58:33,821 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2022-11-23 13:58:33,821 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-11-23 13:58:33,821 INFO L895 garLoopResultBuilder]: At program point L694(line 694) the Hoare annotation is: (let ((.cse17 (+ ~local~0 1))) (let ((.cse6 (= ~t2_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse9 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse10 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~t1_i~0 1)) (.cse11 (<= ~token~0 .cse17)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= .cse17 ~token~0)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse15 (= 0 ~t2_pc~0)) (.cse13 (= ~E_M~0 2)) (.cse16 (= 0 ~t2_st~0)) (.cse14 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse10 .cse3 (= 2 ~t2_st~0) .cse11 .cse5 .cse6 .cse12 .cse7 .cse8 .cse13 .cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse15 .cse16 .cse9) (and .cse0 .cse2 .cse10 .cse3 .cse11 .cse5 .cse12 .cse7 .cse8 .cse15 .cse13 .cse16 .cse14 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))))) [2022-11-23 13:58:33,821 INFO L899 garLoopResultBuilder]: For program point L694-1(line 694) no Hoare annotation was computed. [2022-11-23 13:58:33,822 INFO L895 garLoopResultBuilder]: At program point L1190(lines 1190 1193) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-23 13:58:33,822 INFO L895 garLoopResultBuilder]: At program point L662(lines 625 668) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (= ~t1_pc~0 0)) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse4 (= 2 ~t2_st~0)) (.cse8 (= ~t2_pc~0 1)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (<= 2 ~E_2~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse16 (= 0 ~t2_pc~0)) (.cse11 (= ~E_M~0 2)) (.cse17 (= 0 ~t2_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse15 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse16 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse19 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse18 .cse19 .cse2 .cse5 .cse6 .cse7 .cse9 .cse10 .cse16 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15))) [2022-11-23 13:58:33,822 INFO L899 garLoopResultBuilder]: For program point L629(lines 629 637) no Hoare annotation was computed. [2022-11-23 13:58:33,822 INFO L895 garLoopResultBuilder]: At program point L1125(line 1125) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-23 13:58:33,823 INFO L895 garLoopResultBuilder]: At program point L1125-1(line 1125) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-23 13:58:33,823 INFO L902 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: true [2022-11-23 13:58:33,823 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-11-23 13:58:33,823 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2022-11-23 13:58:33,823 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2022-11-23 13:58:33,823 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2022-11-23 13:58:33,823 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2022-11-23 13:58:33,824 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2022-11-23 13:58:33,824 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 70 98) the Hoare annotation is: true [2022-11-23 13:58:33,824 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 295 314) the Hoare annotation is: true [2022-11-23 13:58:33,824 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2022-11-23 13:58:33,824 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2022-11-23 13:58:33,824 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-11-23 13:58:33,825 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-11-23 13:58:33,825 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 829 853) the Hoare annotation is: true [2022-11-23 13:58:33,825 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 829 853) no Hoare annotation was computed. [2022-11-23 13:58:33,825 INFO L902 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 333 350) the Hoare annotation is: true [2022-11-23 13:58:33,825 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2022-11-23 13:58:33,826 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 957 994) the Hoare annotation is: (let ((.cse29 (= ~t2_pc~0 1)) (.cse27 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse26 (= ~t1_i~0 1)) (.cse24 (= ~t1_pc~0 1)) (.cse25 (<= 2 ~E_1~0)) (.cse18 (<= |old(~E_2~0)| ~E_2~0)) (.cse31 (not (= ~m_st~0 0)))) (let ((.cse14 (not (= ~m_pc~0 0))) (.cse13 (not (= 2 |old(~E_1~0)|))) (.cse20 (= ~E_1~0 2)) (.cse16 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse31)) (.cse1 (and .cse25 .cse18)) (.cse7 (= ~m_pc~0 1)) (.cse8 (not (= ~m_st~0 2))) (.cse11 (not (= 0 ~t2_st~0))) (.cse12 (not (= 0 ~t2_pc~0))) (.cse17 (not (= ~t1_st~0 0))) (.cse0 (not (<= 2 |old(~E_2~0)|))) (.cse2 (not (= ~t2_i~0 1))) (.cse3 (not .cse24)) (.cse21 (not (= 2 ~t2_st~0))) (.cse15 (not (= 2 |old(~E_M~0)|))) (.cse4 (not .cse26)) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse22 (not (= 2 ~t1_st~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not .cse27)) (.cse28 (<= 2 ~E_2~0)) (.cse30 (= ~c_dr_pc~0 0)) (.cse23 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~E_M~0 2)) (.cse10 (not .cse29))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9 .cse12) (or .cse0 .cse2 (not (<= ~token~0 ~local~0)) .cse13 .cse14 .cse15 .cse4 .cse5 (not (= ~t1_pc~0 0)) (not (<= ~local~0 ~token~0)) .cse11 .cse9 .cse12 .cse16 .cse17 (and .cse18 .cse19 .cse20)) (or .cse0 .cse2 .cse3 .cse14 .cse21 .cse15 .cse4 .cse5 .cse22 .cse6 .cse9 (and .cse18 .cse23 .cse19) .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10) (or .cse0 .cse2 .cse3 .cse13 .cse21 .cse4 .cse5 .cse22 .cse6 .cse8 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse18 .cse30 .cse19 .cse20) .cse9 .cse16 .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9 .cse12 .cse17) (or .cse0 (not (< (+ ~local~0 1) ~token~0)) .cse2 .cse3 .cse21 .cse15 .cse4 .cse5 .cse22 .cse6 .cse9 .cse31 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse18 .cse30 .cse23 .cse19) .cse10 (not (<= ~token~0 (+ 2 ~local~0))))))) [2022-11-23 13:58:33,826 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 957 994) no Hoare annotation was computed. [2022-11-23 13:58:33,829 INFO L444 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, 1, 1, 1] [2022-11-23 13:58:33,831 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 13:58:33,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:58:33 BoogieIcfgContainer [2022-11-23 13:58:33,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 13:58:33,905 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 13:58:33,905 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 13:58:33,906 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 13:58:33,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:52:54" (3/4) ... [2022-11-23 13:58:33,909 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 13:58:33,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-23 13:58:33,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-11-23 13:58:33,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-11-23 13:58:33,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-11-23 13:58:33,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-11-23 13:58:33,915 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-11-23 13:58:33,916 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-11-23 13:58:33,916 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-23 13:58:33,916 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-23 13:58:33,916 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-11-23 13:58:33,916 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-11-23 13:58:33,917 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-11-23 13:58:33,917 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-11-23 13:58:33,917 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-11-23 13:58:33,928 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 93 nodes and edges [2022-11-23 13:58:33,929 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-11-23 13:58:33,931 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-23 13:58:33,932 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 13:58:33,958 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || (((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && c_dr_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || (((((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 1 <= __retres1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) [2022-11-23 13:58:33,961 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) && !(E_M == 1))) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0))) || (((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) && !(tmp == 0)) [2022-11-23 13:58:33,961 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) [2022-11-23 13:58:33,962 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st) && __retres1 == 0)) && (((((((((((((!(t2_i == 1) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) || (((((((1 <= __retres1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((((((1 <= __retres1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1)) [2022-11-23 13:58:33,962 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) [2022-11-23 13:58:33,962 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && !(tmp == 0)) [2022-11-23 13:58:33,963 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) || !(t2_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 1 <= __retres1) && __retres1 == 0) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && __retres1 == 0) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) [2022-11-23 13:58:34,036 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 13:58:34,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 13:58:34,038 INFO L158 Benchmark]: Toolchain (without parser) took 340959.51ms. Allocated memory was 161.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 120.0MB in the beginning and 1.1GB in the end (delta: -970.9MB). Peak memory consumption was 640.9MB. Max. memory is 16.1GB. [2022-11-23 13:58:34,038 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 13:58:34,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.98ms. Allocated memory is still 161.5MB. Free memory was 119.6MB in the beginning and 101.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 13:58:34,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.93ms. Allocated memory is still 161.5MB. Free memory was 101.2MB in the beginning and 98.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:58:34,041 INFO L158 Benchmark]: Boogie Preprocessor took 75.09ms. Allocated memory is still 161.5MB. Free memory was 98.2MB in the beginning and 95.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 13:58:34,041 INFO L158 Benchmark]: RCFGBuilder took 1238.44ms. Allocated memory is still 161.5MB. Free memory was 95.6MB in the beginning and 88.6MB in the end (delta: 7.1MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2022-11-23 13:58:34,043 INFO L158 Benchmark]: TraceAbstraction took 338946.20ms. Allocated memory was 161.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 87.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-23 13:58:34,044 INFO L158 Benchmark]: Witness Printer took 131.36ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 13:58:34,052 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.19ms. Allocated memory is still 117.4MB. Free memory is still 66.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.98ms. Allocated memory is still 161.5MB. Free memory was 119.6MB in the beginning and 101.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.93ms. Allocated memory is still 161.5MB. Free memory was 101.2MB in the beginning and 98.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.09ms. Allocated memory is still 161.5MB. Free memory was 98.2MB in the beginning and 95.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1238.44ms. Allocated memory is still 161.5MB. Free memory was 95.6MB in the beginning and 88.6MB in the end (delta: 7.1MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * TraceAbstraction took 338946.20ms. Allocated memory was 161.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 87.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 131.36ms. Allocated memory is still 1.8GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: 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 15 procedures, 157 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 338.8s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 148.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8992 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8882 mSDsluCounter, 12336 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8180 mSDsCounter, 3602 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10964 IncrementalHoareTripleChecker+Invalid, 14566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3602 mSolverCounterUnsat, 4156 mSDtfsCounter, 10964 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3110 GetRequests, 2462 SyntacticMatches, 52 SemanticMatches, 596 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33350 ImplicationChecksByTransitivity, 95.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4038occurred in iteration=19, InterpolantAutomatonStates: 400, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 9034 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 9656 PreInvPairs, 10916 NumberOfFragments, 15759 HoareAnnotationTreeSize, 9656 FomulaSimplifications, 772411 FormulaSimplificationTreeSizeReduction, 90.1s HoareSimplificationTime, 81 FomulaSimplificationsInter, 1968175 FormulaSimplificationTreeSizeReductionInter, 57.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 4390 NumberOfCodeBlocks, 4306 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 4680 ConstructedInterpolants, 0 QuantifiedInterpolants, 8880 SizeOfPredicates, 33 NumberOfNonLiveVariables, 8389 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 46 InterpolantComputations, 24 PerfectInterpolantSequences, 3084/3358 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 2 specifications checked. All of them hold - InvariantResult [Line: 1190]: Loop Invariant Derived loop invariant: (((((((((((m_pc == t1_pc && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 471]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 518]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0)) || (((((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((((t1_i == 1 && m_pc == t1_pc) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || (((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && !(2 == p_dw_pc)) - InvariantResult [Line: 1104]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0 - InvariantResult [Line: 708]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1) && c_dr_pc == 0) || (((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) && p_dw_pc == 1) - InvariantResult [Line: 1129]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: (((((((((((((((((!(m_pc == t1_pc) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) || (((((((((((((((!(m_pc == t1_pc) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 854]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(E_M == 1)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2)) || (((((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((((t1_i == 1 && m_pc == t1_pc) && 2 == t2_st) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 782]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) || !(t2_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 1 <= __retres1) && __retres1 == 0) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && __retres1 == 0) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 763]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st) && __retres1 == 0)) && (((((((((((((!(t2_i == 1) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) || (((((((1 <= __retres1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((((((1 <= __retres1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1)) - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2) && !(tmp == 0) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 712]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || (((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && c_dr_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || (((((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 1 <= __retres1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 1125]: Loop Invariant Derived loop invariant: (((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) - InvariantResult [Line: 672]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) && !(E_M == 1))) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0))) || (((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) && !(tmp == 0)) RESULT: Ultimate proved your program to be correct! [2022-11-23 13:58:34,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2bc4672-a6da-43cd-936c-ac47999ec175/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE