./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI --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 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c --- 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-5e519f3 [2022-11-03 01:52:13,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:52:13,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:52:13,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:52:13,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:52:13,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:52:13,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:52:13,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:52:13,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:52:13,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:52:13,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:52:13,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:52:13,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:52:13,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:52:13,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:52:13,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:52:13,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:52:13,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:52:13,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:52:13,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:52:13,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:52:13,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:52:13,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:52:13,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:52:13,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:52:13,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:52:13,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:52:13,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:52:13,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:52:13,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:52:13,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:52:13,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:52:13,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:52:13,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:52:13,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:52:13,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:52:13,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:52:13,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:52:13,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:52:13,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:52:13,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:52:13,332 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 01:52:13,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:52:13,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:52:13,356 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:52:13,356 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:52:13,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:52:13,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:52:13,357 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:52:13,358 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:52:13,358 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:52:13,358 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:52:13,358 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:52:13,359 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:52:13,359 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:52:13,359 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:52:13,360 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:52:13,360 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:52:13,360 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:52:13,360 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:52:13,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:52:13,361 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:52:13,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:52:13,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:52:13,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:52:13,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:52:13,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:52:13,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:52:13,363 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:52:13,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:52:13,364 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:52:13,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:52:13,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:52:13,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:52:13,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:52:13,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:52:13,365 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:52:13,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:52:13,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:52:13,366 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:52:13,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:52:13,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:52:13,367 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:52:13,367 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_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/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_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI 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 -> 8ff0a322ea14915785d13405f40f59a899d91f6127d01ad0d503cb7ec027b40c [2022-11-03 01:52:13,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:52:13,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:52:13,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:52:13,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:52:13,694 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:52:13,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-11-03 01:52:13,757 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/data/f89124f9e/0346cf13444548bba409ca6957b8413a/FLAG4c73241c6 [2022-11-03 01:52:14,294 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:52:14,295 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-11-03 01:52:14,305 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/data/f89124f9e/0346cf13444548bba409ca6957b8413a/FLAG4c73241c6 [2022-11-03 01:52:14,623 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/data/f89124f9e/0346cf13444548bba409ca6957b8413a [2022-11-03 01:52:14,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:52:14,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:52:14,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:52:14,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:52:14,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:52:14,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:52:14" (1/1) ... [2022-11-03 01:52:14,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112204d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:14, skipping insertion in model container [2022-11-03 01:52:14,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:52:14" (1/1) ... [2022-11-03 01:52:14,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:52:14,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:52:14,918 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2022-11-03 01:52:15,019 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2022-11-03 01:52:15,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:52:15,090 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:52:15,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[911,924] [2022-11-03 01:52:15,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-1.c[8416,8429] [2022-11-03 01:52:15,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:52:15,198 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:52:15,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15 WrapperNode [2022-11-03 01:52:15,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:52:15,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:52:15,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:52:15,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:52:15,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (1/1) ... [2022-11-03 01:52:15,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (1/1) ... [2022-11-03 01:52:15,272 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 440 [2022-11-03 01:52:15,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:52:15,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:52:15,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:52:15,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:52:15,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (1/1) ... [2022-11-03 01:52:15,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (1/1) ... [2022-11-03 01:52:15,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (1/1) ... [2022-11-03 01:52:15,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (1/1) ... [2022-11-03 01:52:15,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (1/1) ... [2022-11-03 01:52:15,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (1/1) ... [2022-11-03 01:52:15,348 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (1/1) ... [2022-11-03 01:52:15,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (1/1) ... [2022-11-03 01:52:15,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:52:15,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:52:15,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:52:15,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:52:15,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (1/1) ... [2022-11-03 01:52:15,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:52:15,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:15,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:52:15,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:52:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:52:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-03 01:52:15,448 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-03 01:52:15,448 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-03 01:52:15,449 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-03 01:52:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-03 01:52:15,449 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-03 01:52:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-03 01:52:15,449 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-03 01:52:15,449 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-03 01:52:15,450 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-03 01:52:15,450 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-03 01:52:15,450 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-03 01:52:15,450 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-03 01:52:15,451 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-03 01:52:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-03 01:52:15,451 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-03 01:52:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-03 01:52:15,452 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-03 01:52:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-03 01:52:15,452 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-03 01:52:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-03 01:52:15,453 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-03 01:52:15,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:52:15,453 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-03 01:52:15,453 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-03 01:52:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-03 01:52:15,454 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-03 01:52:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:52:15,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:52:15,454 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-03 01:52:15,455 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-03 01:52:15,584 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:52:15,586 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:52:16,185 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-11-03 01:52:16,185 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-03 01:52:16,233 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:52:16,422 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:52:16,422 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-03 01:52:16,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:52:16 BoogieIcfgContainer [2022-11-03 01:52:16,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:52:16,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:52:16,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:52:16,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:52:16,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:52:14" (1/3) ... [2022-11-03 01:52:16,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5049c9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:52:16, skipping insertion in model container [2022-11-03 01:52:16,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:15" (2/3) ... [2022-11-03 01:52:16,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5049c9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:52:16, skipping insertion in model container [2022-11-03 01:52:16,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:52:16" (3/3) ... [2022-11-03 01:52:16,436 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-1.c [2022-11-03 01:52:16,456 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:52:16,456 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 01:52:16,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:52:16,543 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;@173b339c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:52:16,544 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 01:52:16,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 98 states have (on average 1.4795918367346939) internal successors, (145), 104 states have internal predecessors, (145), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-03 01:52:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 01:52:16,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:16,563 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] [2022-11-03 01:52:16,565 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:16,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash 42980526, now seen corresponding path program 1 times [2022-11-03 01:52:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:16,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332646032] [2022-11-03 01:52:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:16,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:16,959 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-03 01:52:16,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:16,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332646032] [2022-11-03 01:52:16,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332646032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:16,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:16,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:52:16,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470203864] [2022-11-03 01:52:16,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:16,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:52:16,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:16,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:52:16,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:52:16,998 INFO L87 Difference]: Start difference. First operand has 146 states, 98 states have (on average 1.4795918367346939) internal successors, (145), 104 states have internal predecessors, (145), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-03 01:52:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:17,600 INFO L93 Difference]: Finished difference Result 505 states and 732 transitions. [2022-11-03 01:52:17,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:52:17,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 34 [2022-11-03 01:52:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:17,615 INFO L225 Difference]: With dead ends: 505 [2022-11-03 01:52:17,615 INFO L226 Difference]: Without dead ends: 354 [2022-11-03 01:52:17,619 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-03 01:52:17,622 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 453 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:17,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 495 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:52:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-03 01:52:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 343. [2022-11-03 01:52:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 232 states have (on average 1.3405172413793103) internal successors, (311), 239 states have internal predecessors, (311), 72 states have call successors, (72), 38 states have call predecessors, (72), 37 states have return successors, (88), 67 states have call predecessors, (88), 70 states have call successors, (88) [2022-11-03 01:52:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 471 transitions. [2022-11-03 01:52:17,737 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 471 transitions. Word has length 34 [2022-11-03 01:52:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:17,738 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 471 transitions. [2022-11-03 01:52:17,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-03 01:52:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 471 transitions. [2022-11-03 01:52:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 01:52:17,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:17,741 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-03 01:52:17,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:52:17,741 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash 833281710, now seen corresponding path program 1 times [2022-11-03 01:52:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:17,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715901172] [2022-11-03 01:52:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:17,835 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-03 01:52:17,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:17,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715901172] [2022-11-03 01:52:17,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715901172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:17,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:17,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:52:17,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342632939] [2022-11-03 01:52:17,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:17,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:52:17,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:17,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:52:17,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:52:17,844 INFO L87 Difference]: Start difference. First operand 343 states and 471 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-03 01:52:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:18,171 INFO L93 Difference]: Finished difference Result 543 states and 748 transitions. [2022-11-03 01:52:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:52:18,172 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-03 01:52:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:18,181 INFO L225 Difference]: With dead ends: 543 [2022-11-03 01:52:18,182 INFO L226 Difference]: Without dead ends: 472 [2022-11-03 01:52:18,183 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-03 01:52:18,184 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 251 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:18,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 391 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:52:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-03 01:52:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 461. [2022-11-03 01:52:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 316 states have (on average 1.3386075949367089) internal successors, (423), 323 states have internal predecessors, (423), 92 states have call successors, (92), 52 states have call predecessors, (92), 51 states have return successors, (111), 87 states have call predecessors, (111), 90 states have call successors, (111) [2022-11-03 01:52:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 626 transitions. [2022-11-03 01:52:18,268 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 626 transitions. Word has length 44 [2022-11-03 01:52:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:18,269 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 626 transitions. [2022-11-03 01:52:18,269 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-03 01:52:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 626 transitions. [2022-11-03 01:52:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 01:52:18,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:18,272 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-03 01:52:18,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:52:18,272 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:18,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2049754991, now seen corresponding path program 1 times [2022-11-03 01:52:18,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:18,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748737143] [2022-11-03 01:52:18,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:18,434 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-03 01:52:18,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748737143] [2022-11-03 01:52:18,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748737143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:18,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:18,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:52:18,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419072164] [2022-11-03 01:52:18,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:18,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:52:18,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:52:18,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:52:18,440 INFO L87 Difference]: Start difference. First operand 461 states and 626 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-03 01:52:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:19,248 INFO L93 Difference]: Finished difference Result 998 states and 1349 transitions. [2022-11-03 01:52:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:52:19,249 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-03 01:52:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:19,253 INFO L225 Difference]: With dead ends: 998 [2022-11-03 01:52:19,253 INFO L226 Difference]: Without dead ends: 532 [2022-11-03 01:52:19,255 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-03 01:52:19,256 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 622 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:19,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 754 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 01:52:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-11-03 01:52:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 447. [2022-11-03 01:52:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 302 states have (on average 1.2913907284768211) internal successors, (390), 309 states have internal predecessors, (390), 92 states have call successors, (92), 52 states have call predecessors, (92), 51 states have return successors, (108), 87 states have call predecessors, (108), 90 states have call successors, (108) [2022-11-03 01:52:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 590 transitions. [2022-11-03 01:52:19,321 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 590 transitions. Word has length 45 [2022-11-03 01:52:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:19,321 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 590 transitions. [2022-11-03 01:52:19,322 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-03 01:52:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 590 transitions. [2022-11-03 01:52:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 01:52:19,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:19,332 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-03 01:52:19,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:52:19,332 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:19,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:19,333 INFO L85 PathProgramCache]: Analyzing trace with hash 155440008, now seen corresponding path program 1 times [2022-11-03 01:52:19,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:19,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428681941] [2022-11-03 01:52:19,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:19,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:19,644 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-03 01:52:19,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:19,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428681941] [2022-11-03 01:52:19,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428681941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:19,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:19,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:52:19,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232977632] [2022-11-03 01:52:19,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:19,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:52:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:19,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:52:19,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:52:19,647 INFO L87 Difference]: Start difference. First operand 447 states and 590 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-03 01:52:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:20,214 INFO L93 Difference]: Finished difference Result 749 states and 958 transitions. [2022-11-03 01:52:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 01:52:20,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-11-03 01:52:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:20,220 INFO L225 Difference]: With dead ends: 749 [2022-11-03 01:52:20,220 INFO L226 Difference]: Without dead ends: 575 [2022-11-03 01:52:20,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:52:20,232 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 296 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:20,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 517 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 01:52:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-11-03 01:52:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 549. [2022-11-03 01:52:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 370 states have (on average 1.2756756756756757) internal successors, (472), 377 states have internal predecessors, (472), 112 states have call successors, (112), 66 states have call predecessors, (112), 65 states have return successors, (128), 107 states have call predecessors, (128), 110 states have call successors, (128) [2022-11-03 01:52:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 712 transitions. [2022-11-03 01:52:20,316 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 712 transitions. Word has length 46 [2022-11-03 01:52:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:20,318 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 712 transitions. [2022-11-03 01:52:20,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-03 01:52:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 712 transitions. [2022-11-03 01:52:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 01:52:20,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:20,321 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] [2022-11-03 01:52:20,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:52:20,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:20,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:20,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1186619376, now seen corresponding path program 1 times [2022-11-03 01:52:20,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:20,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222944771] [2022-11-03 01:52:20,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:20,416 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-03 01:52:20,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:20,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222944771] [2022-11-03 01:52:20,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222944771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:20,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:20,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:52:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053785308] [2022-11-03 01:52:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:20,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:52:20,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:52:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:52:20,419 INFO L87 Difference]: Start difference. First operand 549 states and 712 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-03 01:52:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:20,522 INFO L93 Difference]: Finished difference Result 814 states and 1048 transitions. [2022-11-03 01:52:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:52:20,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 47 [2022-11-03 01:52:20,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:20,525 INFO L225 Difference]: With dead ends: 814 [2022-11-03 01:52:20,526 INFO L226 Difference]: Without dead ends: 268 [2022-11-03 01:52:20,527 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-03 01:52:20,528 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 159 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:20,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 143 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:52:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-03 01:52:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-11-03 01:52:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 185 states have internal predecessors, (237), 56 states have call successors, (56), 30 states have call predecessors, (56), 30 states have return successors, (74), 53 states have call predecessors, (74), 56 states have call successors, (74) [2022-11-03 01:52:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 367 transitions. [2022-11-03 01:52:20,561 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 367 transitions. Word has length 47 [2022-11-03 01:52:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:20,561 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 367 transitions. [2022-11-03 01:52:20,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-03 01:52:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 367 transitions. [2022-11-03 01:52:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-03 01:52:20,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:20,563 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:52:20,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:52:20,564 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:20,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1079891644, now seen corresponding path program 1 times [2022-11-03 01:52:20,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:20,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059182576] [2022-11-03 01:52:20,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:20,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 01:52:20,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:20,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059182576] [2022-11-03 01:52:20,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059182576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:20,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:20,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:52:20,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295505964] [2022-11-03 01:52:20,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:20,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:52:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:20,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:52:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:52:20,756 INFO L87 Difference]: Start difference. First operand 268 states and 367 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-03 01:52:20,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:20,979 INFO L93 Difference]: Finished difference Result 675 states and 919 transitions. [2022-11-03 01:52:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:52:20,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 59 [2022-11-03 01:52:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:20,983 INFO L225 Difference]: With dead ends: 675 [2022-11-03 01:52:20,984 INFO L226 Difference]: Without dead ends: 414 [2022-11-03 01:52:20,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:52:20,987 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 160 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:20,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 208 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:52:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-11-03 01:52:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 412. [2022-11-03 01:52:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 277 states have (on average 1.2815884476534296) internal successors, (355), 283 states have internal predecessors, (355), 86 states have call successors, (86), 48 states have call predecessors, (86), 48 states have return successors, (116), 81 states have call predecessors, (116), 86 states have call successors, (116) [2022-11-03 01:52:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 557 transitions. [2022-11-03 01:52:21,056 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 557 transitions. Word has length 59 [2022-11-03 01:52:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:21,057 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 557 transitions. [2022-11-03 01:52:21,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-03 01:52:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 557 transitions. [2022-11-03 01:52:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-03 01:52:21,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:21,059 INFO L195 NwaCegarLoop]: trace histogram [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-03 01:52:21,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:52:21,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:21,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash -887495026, now seen corresponding path program 1 times [2022-11-03 01:52:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:21,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004407040] [2022-11-03 01:52:21,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 01:52:21,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:21,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004407040] [2022-11-03 01:52:21,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004407040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:21,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:21,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:52:21,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84176306] [2022-11-03 01:52:21,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:21,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:52:21,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:21,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:52:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:52:21,129 INFO L87 Difference]: Start difference. First operand 412 states and 557 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03 01:52:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:21,215 INFO L93 Difference]: Finished difference Result 853 states and 1163 transitions. [2022-11-03 01:52:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:52:21,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 60 [2022-11-03 01:52:21,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:21,221 INFO L225 Difference]: With dead ends: 853 [2022-11-03 01:52:21,221 INFO L226 Difference]: Without dead ends: 499 [2022-11-03 01:52:21,222 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-03 01:52:21,225 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 28 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:21,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 175 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:52:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-11-03 01:52:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 443. [2022-11-03 01:52:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 302 states have (on average 1.2913907284768211) internal successors, (390), 308 states have internal predecessors, (390), 89 states have call successors, (89), 51 states have call predecessors, (89), 51 states have return successors, (119), 84 states have call predecessors, (119), 89 states have call successors, (119) [2022-11-03 01:52:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 598 transitions. [2022-11-03 01:52:21,280 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 598 transitions. Word has length 60 [2022-11-03 01:52:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:21,282 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 598 transitions. [2022-11-03 01:52:21,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03 01:52:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 598 transitions. [2022-11-03 01:52:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-03 01:52:21,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:21,289 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:52:21,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:52:21,289 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1085092601, now seen corresponding path program 1 times [2022-11-03 01:52:21,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:21,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507561962] [2022-11-03 01:52:21,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:21,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-03 01:52:21,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:21,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507561962] [2022-11-03 01:52:21,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507561962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:21,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390928764] [2022-11-03 01:52:21,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:21,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:21,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:21,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:21,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:52:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:21,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:52:21,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 01:52:21,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:21,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390928764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:21,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:21,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 01:52:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046884677] [2022-11-03 01:52:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:21,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:52:21,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:21,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:52:21,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:52:21,657 INFO L87 Difference]: Start difference. First operand 443 states and 598 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03 01:52:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:21,741 INFO L93 Difference]: Finished difference Result 845 states and 1149 transitions. [2022-11-03 01:52:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:52:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 87 [2022-11-03 01:52:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:21,746 INFO L225 Difference]: With dead ends: 845 [2022-11-03 01:52:21,746 INFO L226 Difference]: Without dead ends: 522 [2022-11-03 01:52:21,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 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-03 01:52:21,748 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 59 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:21,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 92 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:52:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-03 01:52:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 507. [2022-11-03 01:52:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 357 states have (on average 1.2773109243697478) internal successors, (456), 362 states have internal predecessors, (456), 89 states have call successors, (89), 59 states have call predecessors, (89), 60 states have return successors, (117), 86 states have call predecessors, (117), 89 states have call successors, (117) [2022-11-03 01:52:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 662 transitions. [2022-11-03 01:52:21,823 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 662 transitions. Word has length 87 [2022-11-03 01:52:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:21,824 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 662 transitions. [2022-11-03 01:52:21,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03 01:52:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 662 transitions. [2022-11-03 01:52:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-03 01:52:21,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:21,827 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:52:21,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:22,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:22,046 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:22,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash -423758810, now seen corresponding path program 1 times [2022-11-03 01:52:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:22,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368759323] [2022-11-03 01:52:22,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:22,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 01:52:22,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:22,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368759323] [2022-11-03 01:52:22,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368759323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:22,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72228242] [2022-11-03 01:52:22,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:22,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:22,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:22,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:22,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:52:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:22,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 01:52:22,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 01:52:22,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:22,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72228242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:22,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:22,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 01:52:22,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054743775] [2022-11-03 01:52:22,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:22,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:52:22,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:22,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:52:22,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:52:22,347 INFO L87 Difference]: Start difference. First operand 507 states and 662 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-03 01:52:22,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:22,467 INFO L93 Difference]: Finished difference Result 973 states and 1276 transitions. [2022-11-03 01:52:22,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:52:22,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 87 [2022-11-03 01:52:22,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:22,472 INFO L225 Difference]: With dead ends: 973 [2022-11-03 01:52:22,472 INFO L226 Difference]: Without dead ends: 603 [2022-11-03 01:52:22,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 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-03 01:52:22,474 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 36 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:22,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 178 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:52:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-11-03 01:52:22,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 533. [2022-11-03 01:52:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 377 states have (on average 1.2811671087533156) internal successors, (483), 382 states have internal predecessors, (483), 92 states have call successors, (92), 62 states have call predecessors, (92), 63 states have return successors, (120), 89 states have call predecessors, (120), 92 states have call successors, (120) [2022-11-03 01:52:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 695 transitions. [2022-11-03 01:52:22,555 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 695 transitions. Word has length 87 [2022-11-03 01:52:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:22,555 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 695 transitions. [2022-11-03 01:52:22,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-03 01:52:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 695 transitions. [2022-11-03 01:52:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-03 01:52:22,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:22,558 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:52:22,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:22,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:22,771 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:22,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1097850441, now seen corresponding path program 2 times [2022-11-03 01:52:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:22,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126243698] [2022-11-03 01:52:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:22,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 01:52:22,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:22,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126243698] [2022-11-03 01:52:22,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126243698] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:22,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138906898] [2022-11-03 01:52:22,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:52:22,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:22,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:22,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:22,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:52:23,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:52:23,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:52:23,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:52:23,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 01:52:23,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:23,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138906898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:23,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:23,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 01:52:23,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801392049] [2022-11-03 01:52:23,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:23,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:52:23,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:23,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:52:23,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:52:23,141 INFO L87 Difference]: Start difference. First operand 533 states and 695 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03 01:52:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:23,252 INFO L93 Difference]: Finished difference Result 1036 states and 1393 transitions. [2022-11-03 01:52:23,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:52:23,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 87 [2022-11-03 01:52:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:23,256 INFO L225 Difference]: With dead ends: 1036 [2022-11-03 01:52:23,256 INFO L226 Difference]: Without dead ends: 640 [2022-11-03 01:52:23,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 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-03 01:52:23,258 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 58 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:23,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 180 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:52:23,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-11-03 01:52:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 620. [2022-11-03 01:52:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 442 states have (on average 1.262443438914027) internal successors, (558), 448 states have internal predecessors, (558), 105 states have call successors, (105), 72 states have call predecessors, (105), 72 states have return successors, (143), 100 states have call predecessors, (143), 105 states have call successors, (143) [2022-11-03 01:52:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 806 transitions. [2022-11-03 01:52:23,329 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 806 transitions. Word has length 87 [2022-11-03 01:52:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:23,330 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 806 transitions. [2022-11-03 01:52:23,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-03 01:52:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 806 transitions. [2022-11-03 01:52:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-03 01:52:23,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:23,332 INFO L195 NwaCegarLoop]: trace histogram [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-03 01:52:23,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:23,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:23,547 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:23,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:23,547 INFO L85 PathProgramCache]: Analyzing trace with hash -656583507, now seen corresponding path program 1 times [2022-11-03 01:52:23,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:23,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213715911] [2022-11-03 01:52:23,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:23,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 01:52:23,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:23,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213715911] [2022-11-03 01:52:23,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213715911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:23,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103365151] [2022-11-03 01:52:23,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:23,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:23,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:23,735 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:23,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:52:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:23,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 01:52:23,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 01:52:23,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:52:23,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103365151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:23,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:52:23,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 01:52:23,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466514104] [2022-11-03 01:52:23,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:23,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:52:23,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:23,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:52:23,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:52:23,888 INFO L87 Difference]: Start difference. First operand 620 states and 806 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03 01:52:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:24,013 INFO L93 Difference]: Finished difference Result 1467 states and 1905 transitions. [2022-11-03 01:52:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:52:24,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 88 [2022-11-03 01:52:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:24,019 INFO L225 Difference]: With dead ends: 1467 [2022-11-03 01:52:24,019 INFO L226 Difference]: Without dead ends: 854 [2022-11-03 01:52:24,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 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-03 01:52:24,022 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 33 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 155 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-03 01:52:24,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 155 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:52:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-11-03 01:52:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 685. [2022-11-03 01:52:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 491 states have (on average 1.264765784114053) internal successors, (621), 498 states have internal predecessors, (621), 113 states have call successors, (113), 80 states have call predecessors, (113), 80 states have return successors, (151), 107 states have call predecessors, (151), 113 states have call successors, (151) [2022-11-03 01:52:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 885 transitions. [2022-11-03 01:52:24,117 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 885 transitions. Word has length 88 [2022-11-03 01:52:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:24,117 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 885 transitions. [2022-11-03 01:52:24,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03 01:52:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 885 transitions. [2022-11-03 01:52:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-03 01:52:24,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:24,119 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-03 01:52:24,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:24,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 01:52:24,347 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:24,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:24,347 INFO L85 PathProgramCache]: Analyzing trace with hash 191966113, now seen corresponding path program 1 times [2022-11-03 01:52:24,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:24,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515893820] [2022-11-03 01:52:24,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:24,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-03 01:52:24,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:24,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515893820] [2022-11-03 01:52:24,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515893820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:52:24,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:52:24,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:52:24,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128079196] [2022-11-03 01:52:24,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:52:24,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:52:24,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:24,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:52:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:52:24,467 INFO L87 Difference]: Start difference. First operand 685 states and 885 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-03 01:52:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:24,800 INFO L93 Difference]: Finished difference Result 1656 states and 2112 transitions. [2022-11-03 01:52:24,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:52:24,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 89 [2022-11-03 01:52:24,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:24,806 INFO L225 Difference]: With dead ends: 1656 [2022-11-03 01:52:24,806 INFO L226 Difference]: Without dead ends: 1169 [2022-11-03 01:52:24,808 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-03 01:52:24,809 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 131 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:24,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 233 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:52:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-11-03 01:52:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1131. [2022-11-03 01:52:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 807 states have (on average 1.255266418835192) internal successors, (1013), 811 states have internal predecessors, (1013), 191 states have call successors, (191), 132 states have call predecessors, (191), 132 states have return successors, (227), 188 states have call predecessors, (227), 191 states have call successors, (227) [2022-11-03 01:52:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1431 transitions. [2022-11-03 01:52:25,000 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1431 transitions. Word has length 89 [2022-11-03 01:52:25,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:25,000 INFO L495 AbstractCegarLoop]: Abstraction has 1131 states and 1431 transitions. [2022-11-03 01:52:25,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-03 01:52:25,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1431 transitions. [2022-11-03 01:52:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-03 01:52:25,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:25,003 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-11-03 01:52:25,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 01:52:25,003 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:25,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:25,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1537441805, now seen corresponding path program 1 times [2022-11-03 01:52:25,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:25,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961607183] [2022-11-03 01:52:25,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:25,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-03 01:52:25,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:25,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961607183] [2022-11-03 01:52:25,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961607183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:25,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822262005] [2022-11-03 01:52:25,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:25,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:25,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:25,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:25,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:52:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:25,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 01:52:25,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:52:25,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:52:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-03 01:52:25,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822262005] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:52:25,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1098232477] [2022-11-03 01:52:25,802 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-11-03 01:52:25,802 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:52:25,808 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:52:25,813 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:52:25,813 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:52:38,656 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 115 for LOIs [2022-11-03 01:52:38,686 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 57 for LOIs [2022-11-03 01:52:38,695 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 115 for LOIs [2022-11-03 01:52:38,722 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 74 for LOIs [2022-11-03 01:52:38,833 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 119 for LOIs [2022-11-03 01:52:39,105 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 128 for LOIs [2022-11-03 01:52:39,140 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:52:53,172 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '27980#(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_pc~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 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) (= ~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) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (= ~a_t~0 0) (not (= (+ ~local~0 1) ~token~0)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-03 01:52:53,172 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:52:53,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:52:53,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 16 [2022-11-03 01:52:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83203401] [2022-11-03 01:52:53,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:52:53,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-03 01:52:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:52:53,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-03 01:52:53,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=2821, Unknown=0, NotChecked=0, Total=3192 [2022-11-03 01:52:53,176 INFO L87 Difference]: Start difference. First operand 1131 states and 1431 transitions. Second operand has 16 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2022-11-03 01:52:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:52:55,604 INFO L93 Difference]: Finished difference Result 2469 states and 3134 transitions. [2022-11-03 01:52:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-03 01:52:55,605 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) Word has length 98 [2022-11-03 01:52:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:52:55,613 INFO L225 Difference]: With dead ends: 2469 [2022-11-03 01:52:55,613 INFO L226 Difference]: Without dead ends: 1338 [2022-11-03 01:52:55,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 267 SyntacticMatches, 15 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7789 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=1419, Invalid=15873, Unknown=0, NotChecked=0, Total=17292 [2022-11-03 01:52:55,621 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 630 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:52:55,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1519 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 01:52:55,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-11-03 01:52:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 914. [2022-11-03 01:52:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 658 states have (on average 1.2173252279635258) internal successors, (801), 663 states have internal predecessors, (801), 145 states have call successors, (145), 110 states have call predecessors, (145), 110 states have return successors, (159), 141 states have call predecessors, (159), 145 states have call successors, (159) [2022-11-03 01:52:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1105 transitions. [2022-11-03 01:52:55,760 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1105 transitions. Word has length 98 [2022-11-03 01:52:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:52:55,761 INFO L495 AbstractCegarLoop]: Abstraction has 914 states and 1105 transitions. [2022-11-03 01:52:55,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2022-11-03 01:52:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1105 transitions. [2022-11-03 01:52:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 01:52:55,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:52:55,767 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-11-03 01:52:55,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:52:55,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 01:52:55,983 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:52:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:52:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash 395048492, now seen corresponding path program 1 times [2022-11-03 01:52:55,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:52:55,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658416971] [2022-11-03 01:52:55,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:55,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:52:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 01:52:56,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:52:56,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658416971] [2022-11-03 01:52:56,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658416971] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:52:56,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143433301] [2022-11-03 01:52:56,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:52:56,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:52:56,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:56,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:52:56,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:52:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:52:56,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 01:52:56,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:52:57,061 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 01:52:57,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:52:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-03 01:52:57,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143433301] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:52:57,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [34535309] [2022-11-03 01:52:57,786 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2022-11-03 01:52:57,786 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:52:57,787 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:52:57,787 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:52:57,787 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:53:20,493 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 124 for LOIs [2022-11-03 01:53:20,525 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 124 for LOIs [2022-11-03 01:53:20,551 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 124 for LOIs [2022-11-03 01:53:20,573 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 74 for LOIs [2022-11-03 01:53:20,672 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 128 for LOIs [2022-11-03 01:53:20,981 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 137 for LOIs [2022-11-03 01:53:21,017 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:53:39,607 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '33743#(and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~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) (= ~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) (= ~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) (not (= (+ ~local~0 1) ~token~0)) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-03 01:53:39,607 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:53:39,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:39,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 32 [2022-11-03 01:53:39,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847047842] [2022-11-03 01:53:39,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:39,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:53:39,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:39,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:53:39,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=5072, Unknown=0, NotChecked=0, Total=5550 [2022-11-03 01:53:39,611 INFO L87 Difference]: Start difference. First operand 914 states and 1105 transitions. Second operand has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 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-03 01:53:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:45,221 INFO L93 Difference]: Finished difference Result 1935 states and 2374 transitions. [2022-11-03 01:53:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-03 01:53:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 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 101 [2022-11-03 01:53:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:45,227 INFO L225 Difference]: With dead ends: 1935 [2022-11-03 01:53:45,228 INFO L226 Difference]: Without dead ends: 1293 [2022-11-03 01:53:45,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 256 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9954 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=2947, Invalid=21545, Unknown=0, NotChecked=0, Total=24492 [2022-11-03 01:53:45,236 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 2937 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 1929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2945 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 3917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1929 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:45,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2945 Valid, 510 Invalid, 3917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1929 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 01:53:45,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2022-11-03 01:53:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1126. [2022-11-03 01:53:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 819 states have (on average 1.2039072039072038) internal successors, (986), 824 states have internal predecessors, (986), 171 states have call successors, (171), 135 states have call predecessors, (171), 135 states have return successors, (187), 167 states have call predecessors, (187), 171 states have call successors, (187) [2022-11-03 01:53:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1344 transitions. [2022-11-03 01:53:45,409 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1344 transitions. Word has length 101 [2022-11-03 01:53:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:45,410 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1344 transitions. [2022-11-03 01:53:45,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 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-03 01:53:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1344 transitions. [2022-11-03 01:53:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 01:53:45,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:45,412 INFO L195 NwaCegarLoop]: trace histogram [5, 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, 1, 1] [2022-11-03 01:53:45,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:45,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 01:53:45,639 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:45,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1140451048, now seen corresponding path program 1 times [2022-11-03 01:53:45,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:45,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939756029] [2022-11-03 01:53:45,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:45,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 01:53:45,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:45,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939756029] [2022-11-03 01:53:45,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939756029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:45,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015538530] [2022-11-03 01:53:45,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:45,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:45,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:45,959 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:45,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:53:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:46,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 01:53:46,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:46,200 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 01:53:46,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 01:53:46,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015538530] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:46,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 01:53:46,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 14 [2022-11-03 01:53:46,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025374574] [2022-11-03 01:53:46,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:46,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:46,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:46,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:46,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:53:46,397 INFO L87 Difference]: Start difference. First operand 1126 states and 1344 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-03 01:53:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:46,816 INFO L93 Difference]: Finished difference Result 2236 states and 2671 transitions. [2022-11-03 01:53:46,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:53:46,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 102 [2022-11-03 01:53:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:46,824 INFO L225 Difference]: With dead ends: 2236 [2022-11-03 01:53:46,825 INFO L226 Difference]: Without dead ends: 895 [2022-11-03 01:53:46,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:53:46,831 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 70 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:46,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 214 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:53:46,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-03 01:53:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 746. [2022-11-03 01:53:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 527 states have (on average 1.1480075901328273) internal successors, (605), 533 states have internal predecessors, (605), 126 states have call successors, (126), 96 states have call predecessors, (126), 92 states have return successors, (136), 117 states have call predecessors, (136), 126 states have call successors, (136) [2022-11-03 01:53:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 867 transitions. [2022-11-03 01:53:46,958 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 867 transitions. Word has length 102 [2022-11-03 01:53:46,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:46,959 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 867 transitions. [2022-11-03 01:53:46,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-03 01:53:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 867 transitions. [2022-11-03 01:53:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-03 01:53:46,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:46,962 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:47,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:53:47,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 01:53:47,187 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 01:53:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2068760947, now seen corresponding path program 1 times [2022-11-03 01:53:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:47,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860987823] [2022-11-03 01:53:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:47,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 61 proven. 39 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-11-03 01:53:47,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:47,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860987823] [2022-11-03 01:53:47,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860987823] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:47,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250717019] [2022-11-03 01:53:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:47,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:47,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:47,580 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:47,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:53:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:47,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 01:53:47,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 156 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-03 01:53:47,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 84 proven. 23 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-11-03 01:53:48,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250717019] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:48,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1577392922] [2022-11-03 01:53:48,159 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2022-11-03 01:53:48,159 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:53:48,160 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:53:48,160 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:53:48,160 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:54:15,404 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 180 for LOIs [2022-11-03 01:54:15,854 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 68 for LOIs [2022-11-03 01:54:15,862 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 184 for LOIs [2022-11-03 01:54:15,932 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 126 for LOIs [2022-11-03 01:54:16,278 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 68 for LOIs [2022-11-03 01:54:16,698 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 200 for LOIs [2022-11-03 01:54:18,258 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:54:38,972 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '44279#(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) (= ~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) (= ~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|) (<= 1 ~m_st~0) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (<= 1 ~m_i~0) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (<= 0 ~q_ev~0) (<= ~m_i~0 1) (= ~q_read_ev~0 0) (= |#NULL.offset| 0) (<= ~m_st~0 1) (<= ~q_ev~0 0) (= ~a_t~0 0) (<= 0 ~fast_clk_edge~0) (<= ~fast_clk_edge~0 0) (not (= (+ ~local~0 1) ~token~0)) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-03 01:54:38,973 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:54:38,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:38,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 13 [2022-11-03 01:54:38,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521826075] [2022-11-03 01:54:38,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:38,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:54:38,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:38,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:54:38,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=2890, Unknown=0, NotChecked=0, Total=3192 [2022-11-03 01:54:38,976 INFO L87 Difference]: Start difference. First operand 746 states and 867 transitions. Second operand has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) [2022-11-03 01:54:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:39,566 INFO L93 Difference]: Finished difference Result 898 states and 1036 transitions. [2022-11-03 01:54:39,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 01:54:39,571 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) Word has length 155 [2022-11-03 01:54:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:39,572 INFO L225 Difference]: With dead ends: 898 [2022-11-03 01:54:39,572 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 01:54:39,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 404 SyntacticMatches, 20 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2956 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=506, Invalid=5656, Unknown=0, NotChecked=0, Total=6162 [2022-11-03 01:54:39,580 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 227 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:39,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 508 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:54:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 01:54:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 01:54:39,582 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-03 01:54:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 01:54:39,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2022-11-03 01:54:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:39,584 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 01:54:39,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) [2022-11-03 01:54:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 01:54:39,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 01:54:39,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-03 01:54:39,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-03 01:54:39,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:39,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 01:54:39,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 01:54:54,752 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 915 925) no Hoare annotation was computed. [2022-11-03 01:54:54,753 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 915 925) the Hoare annotation is: (let ((.cse15 (= ~t1_i~0 1)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (= ~p_dw_st~0 0))) (let ((.cse6 (and .cse15 .cse12 .cse13 .cse14 .cse16 (= ~c_dr_pc~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse10 (not (<= 2 ~E_1~0))) (.cse11 (not (= ~E_M~0 1))) (.cse0 (not .cse16)) (.cse1 (not (= ~E_M~0 2))) (.cse2 (= |old(~m_st~0)| 0)) (.cse4 (not .cse15)) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse7 (not .cse14)) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse2 .cse3 .cse4 .cse5 (not (< ~local~0 ~token~0)) .cse6 .cse7 .cse10 (not (<= ~token~0 (+ ~local~0 1))) .cse11) (or .cse0 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 1) (and .cse12 (not (= ~m_st~0 0))) .cse7 .cse10 .cse11) (or (not (= |old(~t1_st~0)| 0)) .cse0 (and .cse13 (= ~t1_st~0 0)) .cse1 .cse2 (not (= ~m_pc~0 0)) .cse4 .cse5 (not (= ~t1_pc~0 0)) .cse7 .cse8 .cse9)))) [2022-11-03 01:54:54,753 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 915 925) no Hoare annotation was computed. [2022-11-03 01:54:54,753 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2022-11-03 01:54:54,753 INFO L902 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 262 276) the Hoare annotation is: true [2022-11-03 01:54:54,754 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 709) no Hoare annotation was computed. [2022-11-03 01:54:54,754 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 890 914) the Hoare annotation is: (let ((.cse3 (= |old(~m_st~0)| 0)) (.cse27 (= ~t1_pc~0 1)) (.cse26 (<= 2 ~E_1~0)) (.cse12 (= ~t1_i~0 1)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~c_dr_pc~0 0))) (let ((.cse1 (and .cse27 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (.cse4 (and (not .cse3) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse6 (not (= ~E_1~0 2))) (.cse19 (not (= ~E_M~0 1))) (.cse5 (not .cse27)) (.cse24 (= ~m_pc~0 1)) (.cse25 (and .cse13 (not (= ~m_st~0 0)))) (.cse10 (not .cse26)) (.cse20 (not (= |old(~t1_st~0)| 0))) (.cse0 (not .cse16)) (.cse21 (and .cse14 (= ~t1_st~0 0))) (.cse2 (not (= ~E_M~0 2))) (.cse22 (not (= ~m_pc~0 0))) (.cse7 (not .cse12)) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse23 (not (= ~t1_pc~0 0))) (.cse9 (not .cse15)) (.cse18 (not (= ~E_1~0 1))) (.cse11 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse2 .cse3 .cse5 .cse7 .cse8 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse9 .cse18 .cse11) (or .cse0 .cse1 .cse3 .cse5 .cse7 .cse8 (not (< ~local~0 ~token~0)) .cse9 .cse10 (not (<= ~token~0 (+ ~local~0 1))) .cse19) (or .cse20 .cse0 .cse21 .cse2 .cse4 .cse22 .cse6 .cse7 .cse8 .cse23 .cse9 .cse11) (or .cse0 .cse3 .cse5 .cse7 .cse8 .cse24 .cse25 .cse9 .cse10 .cse19) (or .cse0 .cse2 .cse3 .cse5 .cse7 .cse8 .cse24 .cse25 .cse9 .cse10) (or .cse20 .cse0 .cse21 .cse2 .cse3 .cse22 .cse7 .cse8 .cse23 .cse9 .cse18 .cse11)))) [2022-11-03 01:54:54,756 INFO L895 garLoopResultBuilder]: At program point L733(lines 721 735) the Hoare annotation is: (let ((.cse13 (= ~m_st~0 0)) (.cse2 (= |old(~m_st~0)| 0)) (.cse7 (= ~m_pc~0 1))) (let ((.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (<= 2 ~E_1~0)) (.cse17 (not (= ~m_pc~0 ~t1_pc~0))) (.cse11 (= ~t1_i~0 1)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (not .cse7)) (.cse14 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse28 (or (and (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (not .cse13)) .cse2)) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (= ~c_dr_pc~0 0))) (let ((.cse4 (and .cse10 .cse17 .cse11 .cse12 .cse18 .cse14 .cse28 .cse15 .cse16)) (.cse19 (not (= ~E_M~0 1))) (.cse20 (not (= |old(~t1_st~0)| 0))) (.cse21 (not (= ~m_pc~0 0))) (.cse22 (not (= ~t1_pc~0 0))) (.cse24 (and .cse29 (= ~t1_st~0 0) .cse28)) (.cse26 (and (not .cse2) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse27 (not (= ~E_1~0 2))) (.cse9 (not .cse10)) (.cse0 (not .cse15)) (.cse1 (not (= ~E_M~0 2))) (.cse3 (not (= ~t1_pc~0 1))) (.cse5 (not .cse11)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse8 (not .cse14)) (.cse23 (not (= ~E_1~0 1))) (.cse25 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 (and .cse10 .cse11 .cse12 .cse13 .cse14 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse15 .cse16) .cse2 .cse3 .cse5 .cse6 (not (< ~local~0 ~token~0)) .cse8 (and .cse10 .cse17 .cse11 .cse12 .cse18 .cse14 .cse15 .cse16) .cse9 (not (<= ~token~0 (+ ~local~0 1))) .cse19) (or .cse20 .cse0 .cse1 .cse2 .cse21 .cse5 .cse6 .cse22 .cse8 .cse23 .cse24 .cse25) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19) (or .cse20 .cse0 .cse1 .cse26 .cse21 .cse27 .cse5 .cse6 .cse22 .cse8 .cse24 .cse25) (or .cse0 .cse1 .cse2 (and .cse10 .cse11 (= ~m_st~0 ~E_M~0) .cse12 .cse14 .cse28 .cse15 .cse16) .cse26 .cse3 .cse27 .cse5 .cse6 .cse8 .cse9 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (and .cse12 .cse29 .cse28) .cse8 .cse23 .cse25))))) [2022-11-03 01:54:54,756 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 728) no Hoare annotation was computed. [2022-11-03 01:54:54,756 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 712) no Hoare annotation was computed. [2022-11-03 01:54:54,756 INFO L899 garLoopResultBuilder]: For program point L703-2(lines 703 712) no Hoare annotation was computed. [2022-11-03 01:54:54,756 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 890 914) no Hoare annotation was computed. [2022-11-03 01:54:54,757 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 731) no Hoare annotation was computed. [2022-11-03 01:54:54,758 INFO L899 garLoopResultBuilder]: For program point L722-2(lines 722 731) no Hoare annotation was computed. [2022-11-03 01:54:54,759 INFO L895 garLoopResultBuilder]: At program point L714(lines 702 716) the Hoare annotation is: (let ((.cse27 (= ~m_pc~0 1)) (.cse4 (= |old(~m_st~0)| 0))) (let ((.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (<= 2 ~E_1~0)) (.cse15 (= ~t1_i~0 1)) (.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (or (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse4)) (.cse17 (not .cse27)) (.cse18 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse19 (= ~p_dw_st~0 0)) (.cse20 (= ~c_dr_pc~0 0))) (let ((.cse23 (not (= ~E_M~0 1))) (.cse28 (and .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 (not (= ~m_st~0 0)) .cse20)) (.cse22 (not .cse14)) (.cse12 (not .cse13)) (.cse10 (not (= ~E_1~0 1))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not .cse19)) (.cse2 (and .cse26 .cse21 (= ~t1_st~0 0))) (.cse3 (not (= ~E_M~0 2))) (.cse24 (and (not .cse4) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse5 (not (= ~m_pc~0 0))) (.cse25 (not (= ~E_1~0 2))) (.cse6 (not .cse15)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~t1_pc~0 0))) (.cse9 (not .cse18)) (.cse11 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse4 .cse12 .cse6 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse7 (and .cse13 .cse14 .cse15 .cse16 .cse21 .cse18 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse19 .cse20) (not (< ~local~0 ~token~0)) .cse9 .cse22 (not (<= ~token~0 (+ ~local~0 1))) .cse23) (or .cse1 .cse3 .cse4 .cse24 .cse12 .cse25 .cse6 .cse7 .cse9 (and .cse13 .cse14 .cse15 (= ~m_st~0 ~E_M~0) .cse16 .cse26 .cse18 .cse19 .cse20) .cse22 .cse11) (or .cse1 .cse4 .cse12 .cse6 .cse7 .cse27 .cse9 .cse28 .cse22 .cse23) (or .cse1 .cse3 .cse4 .cse12 .cse6 .cse7 .cse27 .cse9 .cse28 .cse22) (or .cse1 .cse3 .cse4 .cse12 .cse6 .cse7 (and .cse15 .cse16 .cse26 .cse21 .cse18 .cse19 .cse20) .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse24 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse11))))) [2022-11-03 01:54:54,759 INFO L895 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 387 411) the Hoare annotation is: (or (= |old(~p_dw_st~0)| ~p_dw_st~0) (not (= ~m_pc~0 ~t1_pc~0)) (not (= ~c_dr_pc~0 0)) (= ~m_pc~0 1) (not (= ~p_dw_i~0 1))) [2022-11-03 01:54:54,759 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2022-11-03 01:54:54,759 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2022-11-03 01:54:54,759 INFO L895 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: (or (= |old(~p_dw_st~0)| ~p_dw_st~0) (not (= ~m_pc~0 ~t1_pc~0)) (not (= ~c_dr_pc~0 0)) (= ~m_pc~0 1) (not (= ~p_dw_i~0 1))) [2022-11-03 01:54:54,759 INFO L895 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: (or (not (= ~m_pc~0 ~t1_pc~0)) (not (= ~c_dr_pc~0 0)) (= ~m_pc~0 1) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (not (= |old(~p_dw_st~0)| 0))) [2022-11-03 01:54:54,760 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2022-11-03 01:54:54,760 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 737 744) no Hoare annotation was computed. [2022-11-03 01:54:54,760 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 737 744) the Hoare annotation is: true [2022-11-03 01:54:54,760 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 834 861) the Hoare annotation is: (let ((.cse1 (= ~m_st~0 0)) (.cse6 (= ~E_M~0 2))) (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse8 (and .cse6 (= ~E_1~0 2))) (.cse2 (not (= ~t1_pc~0 1))) (.cse9 (not (= 2 |old(~E_1~0)|))) (.cse3 (not (= 2 |old(~E_M~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (and (not (= ~m_st~0 |old(~E_M~0)|)) (not .cse1))) (.cse11 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 |old(~E_1~0)|)) (= ~m_pc~0 1) (and (= ~E_1~0 |old(~E_1~0)|) .cse6) .cse7) (or .cse0 .cse8 .cse9 (not (= ~m_pc~0 0)) .cse3 .cse4 .cse5 (not (= ~t1_pc~0 0)) .cse7 .cse10 (not (= ~t1_st~0 0)) .cse11) (or .cse0 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11)))) [2022-11-03 01:54:54,760 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 834 861) no Hoare annotation was computed. [2022-11-03 01:54:54,760 INFO L902 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 315 332) the Hoare annotation is: true [2022-11-03 01:54:54,761 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2022-11-03 01:54:54,761 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 99 127) the Hoare annotation is: true [2022-11-03 01:54:54,761 INFO L902 garLoopResultBuilder]: At program point L124(lines 102 126) the Hoare annotation is: true [2022-11-03 01:54:54,761 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2022-11-03 01:54:54,761 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2022-11-03 01:54:54,761 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2022-11-03 01:54:54,761 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2022-11-03 01:54:54,762 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2022-11-03 01:54:54,762 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2022-11-03 01:54:54,762 INFO L899 garLoopResultBuilder]: For program point L1026-2(lines 1026 1035) no Hoare annotation was computed. [2022-11-03 01:54:54,762 INFO L895 garLoopResultBuilder]: At program point L828(lines 783 833) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,762 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-11-03 01:54:54,762 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2022-11-03 01:54:54,763 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,763 INFO L895 garLoopResultBuilder]: At program point L599(line 599) the Hoare annotation is: false [2022-11-03 01:54:54,763 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1069) no Hoare annotation was computed. [2022-11-03 01:54:54,763 INFO L895 garLoopResultBuilder]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,763 INFO L895 garLoopResultBuilder]: At program point L1030-1(line 1030) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,764 INFO L899 garLoopResultBuilder]: For program point L799(lines 789 827) no Hoare annotation was computed. [2022-11-03 01:54:54,764 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 675) no Hoare annotation was computed. [2022-11-03 01:54:54,764 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,764 INFO L895 garLoopResultBuilder]: At program point L1065(lines 1065 1068) 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) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:54:54,764 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-03 01:54:54,765 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,765 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,765 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2022-11-03 01:54:54,765 INFO L895 garLoopResultBuilder]: At program point L1000(line 1000) 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) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:54:54,765 INFO L895 garLoopResultBuilder]: At program point L1000-1(line 1000) 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) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:54:54,765 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 809) no Hoare annotation was computed. [2022-11-03 01:54:54,766 INFO L895 garLoopResultBuilder]: At program point L670(lines 670 674) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 (= ~token~0 ~local~0) (= ~E_1~0 2) .cse7) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 (not (= ~m_st~0 0)) .cse5 .cse6 .cse7))) [2022-11-03 01:54:54,766 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2022-11-03 01:54:54,766 INFO L895 garLoopResultBuilder]: At program point L1002(line 1002) 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) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:54:54,766 INFO L895 garLoopResultBuilder]: At program point L1002-1(line 1002) 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) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:54:54,766 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,767 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2022-11-03 01:54:54,767 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2022-11-03 01:54:54,767 INFO L895 garLoopResultBuilder]: At program point L210(lines 210 214) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 1)) [2022-11-03 01:54:54,767 INFO L895 garLoopResultBuilder]: At program point L1003(line 1003) 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) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 2) (= ~token~0 ~local~0) (= ~E_1~0 2)) [2022-11-03 01:54:54,767 INFO L895 garLoopResultBuilder]: At program point L640(line 640) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= ~E_1~0 1)) (.cse2 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-03 01:54:54,768 INFO L899 garLoopResultBuilder]: For program point L640-1(line 640) no Hoare annotation was computed. [2022-11-03 01:54:54,768 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,768 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,768 INFO L899 garLoopResultBuilder]: For program point L1039(lines 1039 1043) no Hoare annotation was computed. [2022-11-03 01:54:54,768 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,768 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,769 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2022-11-03 01:54:54,769 INFO L895 garLoopResultBuilder]: At program point L1007-1(lines 1004 1044) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,769 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,769 INFO L895 garLoopResultBuilder]: At program point L678-1(lines 666 697) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~t1_i~0 1)) (.cse8 (not (= ~m_pc~0 1))) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 .cse6 (< ~local~0 ~token~0) .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 (not .cse2) .cse5 .cse6 .cse7) (and .cse0 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0))) (= ~t1_pc~0 0) .cse1 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 (= ~token~0 ~local~0) (= ~E_1~0 2) .cse7) (and .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7))) [2022-11-03 01:54:54,769 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,770 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2022-11-03 01:54:54,770 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 01:54:54,770 INFO L895 garLoopResultBuilder]: At program point L813(lines 789 827) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse14 (= ~m_pc~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse10 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (= ~t1_st~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~E_M~0 2)) (.cse11 (= ~token~0 ~local~0)) (.cse12 (= ~E_1~0 2)) (.cse9 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse7 .cse8 (< ~local~0 ~token~0) .cse9) (and .cse0 .cse3 .cse10 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse3 (= ~m_pc~0 ~t1_pc~0) .cse5 (or .cse10 .cse4) .cse13 .cse6 .cse7 .cse14 .cse8 .cse11 .cse12) (and .cse0 .cse2 .cse3 (not (= ~m_pc~0 1)) .cse5 .cse6 (not .cse4) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9) (and (= ~t1_pc~0 0) .cse3 .cse10 .cse5 .cse13 .cse6 .cse7 .cse8 .cse11 .cse12 .cse9))) [2022-11-03 01:54:54,770 INFO L895 garLoopResultBuilder]: At program point L648-1(lines 622 661) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 (not (= ~m_pc~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 .cse6 .cse7 (< ~local~0 ~token~0) .cse8) (and .cse2 (= ~m_pc~0 ~t1_pc~0) .cse3 (= ~t1_st~0 0) .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 (= ~token~0 ~local~0) (= ~E_1~0 2) .cse8))) [2022-11-03 01:54:54,770 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-11-03 01:54:54,771 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2022-11-03 01:54:54,771 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-03 01:54:54,771 INFO L902 garLoopResultBuilder]: At program point L1045(lines 992 1050) the Hoare annotation is: true [2022-11-03 01:54:54,771 INFO L895 garLoopResultBuilder]: At program point L979(line 979) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,771 INFO L895 garLoopResultBuilder]: At program point L979-1(line 979) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,772 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,772 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2022-11-03 01:54:54,772 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,772 INFO L899 garLoopResultBuilder]: For program point L816(lines 816 823) no Hoare annotation was computed. [2022-11-03 01:54:54,772 INFO L895 garLoopResultBuilder]: At program point L1015(line 1015) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,772 INFO L899 garLoopResultBuilder]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2022-11-03 01:54:54,773 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2022-11-03 01:54:54,773 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 01:54:54,773 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2022-11-03 01:54:54,773 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,773 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,773 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-11-03 01:54:54,773 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2022-11-03 01:54:54,774 INFO L895 garLoopResultBuilder]: At program point L688(line 688) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse9 (= ~E_M~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse6 .cse7 (< ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (not (= ~m_pc~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-03 01:54:54,774 INFO L899 garLoopResultBuilder]: For program point L688-1(line 688) no Hoare annotation was computed. [2022-11-03 01:54:54,774 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2022-11-03 01:54:54,774 INFO L895 garLoopResultBuilder]: At program point L1019(line 1019) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,774 INFO L895 garLoopResultBuilder]: At program point L1019-1(line 1019) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,775 INFO L895 garLoopResultBuilder]: At program point L656(lines 619 662) the Hoare annotation is: (let ((.cse0 (= ~t1_i~0 1)) (.cse1 (= ~m_st~0 ~E_M~0)) (.cse2 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~token~0 ~local~0)) (.cse7 (= ~E_1~0 2)) (.cse8 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and (not (= ~m_pc~0 ~t1_pc~0)) (= ~t1_pc~0 0) .cse0 .cse1 .cse2 (= ~t1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-03 01:54:54,775 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 631) no Hoare annotation was computed. [2022-11-03 01:54:54,775 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) (= ~p_dw_i~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 1) .cse2))) [2022-11-03 01:54:54,775 INFO L895 garLoopResultBuilder]: At program point L1020(line 1020) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,775 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) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1)) [2022-11-03 01:54:54,776 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) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1)) [2022-11-03 01:54:54,776 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,776 INFO L895 garLoopResultBuilder]: At program point L1021(line 1021) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,776 INFO L895 garLoopResultBuilder]: At program point L790(line 790) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (<= 2 ~E_1~0)) (.cse14 (= ~m_pc~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse10 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (= ~t1_st~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_pc~0 0)) (.cse8 (= ~E_M~0 2)) (.cse11 (= ~token~0 ~local~0)) (.cse12 (= ~E_1~0 2)) (.cse9 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse7 .cse8 (< ~local~0 ~token~0) .cse9) (and .cse0 .cse3 .cse10 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse3 (= ~m_pc~0 ~t1_pc~0) .cse5 (or .cse10 .cse4) .cse13 .cse6 .cse7 .cse14 .cse8 .cse11 .cse12) (and .cse0 .cse2 .cse3 (not (= ~m_pc~0 1)) .cse5 .cse6 (not .cse4) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9) (and (= ~t1_pc~0 0) .cse3 .cse10 .cse5 .cse13 .cse6 .cse7 .cse8 .cse11 .cse12 .cse9))) [2022-11-03 01:54:54,777 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) (= ~p_dw_i~0 1)))) [2022-11-03 01:54:54,777 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2022-11-03 01:54:54,777 INFO L899 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2022-11-03 01:54:54,777 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) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1)) [2022-11-03 01:54:54,777 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) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1)) [2022-11-03 01:54:54,777 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2022-11-03 01:54:54,777 INFO L899 garLoopResultBuilder]: For program point L792(line 792) no Hoare annotation was computed. [2022-11-03 01:54:54,778 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2022-11-03 01:54:54,778 INFO L895 garLoopResultBuilder]: At program point L627(lines 622 661) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~t1_i~0 1) (<= ~token~0 (+ ~local~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (= ~c_dr_pc~0 0) (= ~E_M~0 2) (< ~local~0 ~token~0) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) [2022-11-03 01:54:54,778 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) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1)) [2022-11-03 01:54:54,778 INFO L899 garLoopResultBuilder]: For program point L1024(line 1024) no Hoare annotation was computed. [2022-11-03 01:54:54,778 INFO L899 garLoopResultBuilder]: For program point L794(lines 794 798) no Hoare annotation was computed. [2022-11-03 01:54:54,778 INFO L899 garLoopResultBuilder]: For program point L794-1(lines 789 827) no Hoare annotation was computed. [2022-11-03 01:54:54,779 INFO L895 garLoopResultBuilder]: At program point L1026(lines 1026 1035) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~token~0 ~local~0)) (.cse8 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (= ~m_st~0 0)) (.cse5 (= ~c_dr_pc~0 0)) (.cse6 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~m_pc~0 ~t1_pc~0) .cse3 (or .cse2 .cse9) (= ~t1_st~0 0) .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7 .cse8) (and .cse0 (<= 2 ~E_1~0) .cse1 (not (= ~m_pc~0 1)) .cse3 .cse4 (not .cse9) .cse5 .cse6))) [2022-11-03 01:54:54,779 INFO L895 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: (or (not (= ~m_pc~0 ~t1_pc~0)) (not (= ~p_dw_st~0 0)) (not (= ~p_dw_pc~0 0)) (= ~m_pc~0 1) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (not (= ~p_dw_i~0 1)) (= is_do_write_p_triggered_~__retres1~0 0)) [2022-11-03 01:54:54,779 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-11-03 01:54:54,779 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2022-11-03 01:54:54,779 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2022-11-03 01:54:54,779 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2022-11-03 01:54:54,780 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2022-11-03 01:54:54,780 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2022-11-03 01:54:54,780 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 70 98) the Hoare annotation is: true [2022-11-03 01:54:54,780 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 295 314) the Hoare annotation is: true [2022-11-03 01:54:54,780 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2022-11-03 01:54:54,780 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2022-11-03 01:54:54,781 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-11-03 01:54:54,781 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-11-03 01:54:54,781 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 763 782) the Hoare annotation is: true [2022-11-03 01:54:54,781 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 763 782) no Hoare annotation was computed. [2022-11-03 01:54:54,781 INFO L902 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 333 350) the Hoare annotation is: true [2022-11-03 01:54:54,781 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2022-11-03 01:54:54,781 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 862 889) no Hoare annotation was computed. [2022-11-03 01:54:54,782 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 862 889) the Hoare annotation is: (let ((.cse1 (= ~m_st~0 0)) (.cse6 (= ~E_M~0 2))) (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse8 (and .cse6 (= ~E_1~0 2))) (.cse2 (not (= ~t1_pc~0 1))) (.cse9 (not (= 2 |old(~E_1~0)|))) (.cse3 (not (= 2 |old(~E_M~0)|))) (.cse4 (not (= ~t1_i~0 1))) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (and (not (= ~m_st~0 |old(~E_M~0)|)) (not .cse1))) (.cse11 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 2 |old(~E_1~0)|)) (= ~m_pc~0 1) (and (= ~E_1~0 |old(~E_1~0)|) .cse6) .cse7) (or .cse0 .cse8 .cse9 (not (= ~m_pc~0 0)) .cse3 .cse4 .cse5 (not (= ~t1_pc~0 0)) .cse7 .cse10 (not (= ~t1_st~0 0)) .cse11) (or .cse0 .cse8 .cse1 .cse2 .cse9 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11)))) [2022-11-03 01:54:54,785 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:54,788 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 01:54:54,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:54:54 BoogieIcfgContainer [2022-11-03 01:54:54,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 01:54:54,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 01:54:54,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 01:54:54,868 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 01:54:54,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:52:16" (3/4) ... [2022-11-03 01:54:54,871 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 01:54:54,880 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-03 01:54:54,880 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-11-03 01:54:54,880 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-11-03 01:54:54,880 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-11-03 01:54:54,881 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-11-03 01:54:54,881 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-11-03 01:54:54,881 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-11-03 01:54:54,881 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-03 01:54:54,881 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-03 01:54:54,881 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-11-03 01:54:54,882 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-11-03 01:54:54,882 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-11-03 01:54:54,882 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-11-03 01:54:54,882 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-11-03 01:54:54,894 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 79 nodes and edges [2022-11-03 01:54:54,901 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-03 01:54:54,903 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-03 01:54:54,904 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 01:54:54,934 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(token == local)) && (((((((((((!(p_dw_st == 0) || \old(m_st) == 0) || !(t1_pc == 1)) || !(t1_i == 1)) || (((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0)) || !(p_dw_pc == 0)) || ((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && (((((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 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)) || ((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(p_dw_st == 0) || \old(m_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) && t1_i == 1) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0)) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_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) && t1_i == 1) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(token == local))) && (((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || (!(\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)) || !(c_dr_pc == p_dw_pc)) || !(token == local)) [2022-11-03 01:54:54,944 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || !(t1_pc == 1)) || ((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) && (((((((((((!(p_dw_st == 0) || (((((((2 <= E_1 && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && (((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0))) || !(token == local))) && (((((((((!(p_dw_st == 0) || \old(m_st) == 0) || !(t1_pc == 1)) || ((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || (!(\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)) || !(c_dr_pc == p_dw_pc)) || ((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0))) || !(token == local))) && (((((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || (((((((2 <= E_1 && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && 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)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0))) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(token == local)) [2022-11-03 01:54:54,945 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((2 <= E_1 && t1_i == 1) && m_st == 0) && token <= local + 1) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && local < token) && !(tmp == 0)) || ((((((((2 <= E_1 && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0))) || (((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) && !(tmp == 0))) || ((((((((2 <= E_1 && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0)) [2022-11-03 01:54:54,945 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) && !(tmp == 0)) || ((((((((((t1_pc == 1 && 2 <= E_1) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0)) [2022-11-03 01:54:55,024 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 01:54:55,027 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 01:54:55,028 INFO L158 Benchmark]: Toolchain (without parser) took 160396.42ms. Allocated memory was 94.4MB in the beginning and 1.0GB in the end (delta: 941.6MB). Free memory was 58.7MB in the beginning and 916.0MB in the end (delta: -857.3MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2022-11-03 01:54:55,029 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 94.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 01:54:55,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.71ms. Allocated memory is still 94.4MB. Free memory was 58.5MB in the beginning and 64.3MB in the end (delta: -5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 01:54:55,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.90ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 61.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 01:54:55,031 INFO L158 Benchmark]: Boogie Preprocessor took 77.34ms. Allocated memory is still 94.4MB. Free memory was 61.5MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 01:54:55,031 INFO L158 Benchmark]: RCFGBuilder took 1070.28ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 58.9MB in the beginning and 55.4MB in the end (delta: 3.4MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-11-03 01:54:55,032 INFO L158 Benchmark]: TraceAbstraction took 158438.67ms. Allocated memory was 115.3MB in the beginning and 1.0GB in the end (delta: 920.6MB). Free memory was 54.8MB in the beginning and 925.4MB in the end (delta: -870.7MB). Peak memory consumption was 616.5MB. Max. memory is 16.1GB. [2022-11-03 01:54:55,032 INFO L158 Benchmark]: Witness Printer took 160.33ms. Allocated memory is still 1.0GB. Free memory was 925.4MB in the beginning and 916.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 01:54:55,036 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.23ms. Allocated memory is still 94.4MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.71ms. Allocated memory is still 94.4MB. Free memory was 58.5MB in the beginning and 64.3MB in the end (delta: -5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.90ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 61.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.34ms. Allocated memory is still 94.4MB. Free memory was 61.5MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1070.28ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 58.9MB in the beginning and 55.4MB in the end (delta: 3.4MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 158438.67ms. Allocated memory was 115.3MB in the beginning and 1.0GB in the end (delta: 920.6MB). Free memory was 54.8MB in the beginning and 925.4MB in the end (delta: -870.7MB). Peak memory consumption was 616.5MB. Max. memory is 16.1GB. * Witness Printer took 160.33ms. Allocated memory is still 1.0GB. Free memory was 925.4MB in the beginning and 916.0MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 146 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 158.3s, OverallIterations: 16, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6222 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6150 mSDsluCounter, 6272 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4831 mSDsCounter, 3035 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5885 IncrementalHoareTripleChecker+Invalid, 8920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3035 mSolverCounterUnsat, 2247 mSDtfsCounter, 5885 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1996 GetRequests, 1516 SyntacticMatches, 45 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20770 ImplicationChecksByTransitivity, 58.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1131occurred in iteration=12, InterpolantAutomatonStates: 270, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 1243 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 77 LocationsWithAnnotation, 2180 PreInvPairs, 2652 NumberOfFragments, 5019 HoareAnnotationTreeSize, 2180 FomulaSimplifications, 14681 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 77 FomulaSimplificationsInter, 108121 FormulaSimplificationTreeSizeReductionInter, 11.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2034 NumberOfCodeBlocks, 1999 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2462 ConstructedInterpolants, 0 QuantifiedInterpolants, 5019 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3407 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 28 InterpolantComputations, 13 PerfectInterpolantSequences, 1508/1678 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: 1030]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) || ((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token == local) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 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) && p_dw_i == 1) - 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) && p_dw_i == 1) - 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) && p_dw_i == 1) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1 - InvariantResult [Line: 1026]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) || ((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token == local) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 2) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (((((!(m_pc == t1_pc) || !(p_dw_st == 0)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(p_dw_i == 1)) || __retres1 == 0 - 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) && p_dw_i == 1) - InvariantResult [Line: 789]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && m_st == 0) && token <= local + 1) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && local < token) && !(tmp == 0)) || ((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2)) || ((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token == local) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && 2 <= E_1) && t1_i == 1) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0))) || ((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 979]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) || ((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token == local) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 2) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: ((((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && p_dw_i == 1 - InvariantResult [Line: 702]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(token == local)) && (((((((((((!(p_dw_st == 0) || \old(m_st) == 0) || !(t1_pc == 1)) || !(t1_i == 1)) || (((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0)) || !(p_dw_pc == 0)) || ((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && (((((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 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)) || ((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(p_dw_st == 0) || \old(m_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) && t1_i == 1) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0)) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_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) && t1_i == 1) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0)) || !(2 <= E_1))) && (((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(token == local))) && (((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || (!(\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)) || !(c_dr_pc == p_dw_pc)) || !(token == local)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1) || (((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) && p_dw_pc == 1) - InvariantResult [Line: 1000]: Loop Invariant Derived loop invariant: (((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token == local) && E_1 == 2 - InvariantResult [Line: 763]: 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) && p_dw_i == 1) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || !(t1_pc == 1)) || ((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) && (((((((((((!(p_dw_st == 0) || (((((((2 <= E_1 && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0)) || !(2 <= E_1)) || !(token <= local + 1)) || !(E_M == 1))) && (((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0))) || !(token == local))) && (((((((((!(p_dw_st == 0) || \old(m_st) == 0) || !(t1_pc == 1)) || ((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || (!(\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)) || !(c_dr_pc == p_dw_pc)) || ((m_st == \old(m_st) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0))) || !(token == local))) && (((((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || (((((((2 <= E_1 && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && 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)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0))) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(token == local)) - InvariantResult [Line: 992]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 670]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) && !(tmp == 0)) || ((((((((((t1_pc == 1 && 2 <= E_1) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: ((((((((m_pc == t1_pc && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token == local) && E_1 == 2 - 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: 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) && p_dw_i == 1) - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 2) && local < token) && !(tmp == 0) - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 2) && local < token) && !(tmp == 0))) || (((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && t1_st == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token == local) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 1004]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) || ((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token == local) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 2) - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) || ((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token == local) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 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) && p_dw_i == 1) - 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) && p_dw_i == 1) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 619]: Loop Invariant Derived loop invariant: (((((((((((!(m_pc == t1_pc) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) && !(tmp == 0)) || (((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) && !(tmp == 0)) - 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) && p_dw_i == 1) - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: (((((((((((2 <= E_1 && t1_i == 1) && m_st == 0) && token <= local + 1) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && local < token) && !(tmp == 0)) || ((((((((2 <= E_1 && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0))) || (((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && E_M == 2) && token == local) && E_1 == 2) && !(tmp == 0))) || ((((((((2 <= E_1 && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) RESULT: Ultimate proved your program to be correct! [2022-11-03 01:54:55,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c571809-52b1-45a5-aa42-c651b38e5c18/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE